1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875
|
(**************************************************************************)
(* *)
(* Ocamlgraph: a generic graph library for OCaml *)
(* Copyright (C) 2004-2010 *)
(* Sylvain Conchon, Jean-Christophe Filliatre and Julien Signoles *)
(* *)
(* This software is free software; you can redistribute it and/or *)
(* modify it under the terms of the GNU Library General Public *)
(* License version 2.1, with the special exception on linking *)
(* described in file LICENSE. *)
(* *)
(* This software is distributed in the hope that it will be useful, *)
(* but WITHOUT ANY WARRANTY; without even the implied warranty of *)
(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. *)
(* *)
(**************************************************************************)
open Format
open Outils_tort
open Outils_math
open Graph
(* graph data structure *)
module Gr = struct
module G = Imperative.Graph.Abstract(String)
module B = Builder.I(G)
module GmlParser =
Gml.Parse
(B)
(struct
let node l =
try
match List.assoc "id" l
with Gml.Int n -> string_of_int n | _ -> "<no id>"
with Not_found -> "<no id>"
let edge _ = ()
end)
module DotParser =
Dot.Parse
(B)
(struct
let node (id,_) _ = match id with
| Dot_ast.Ident s
| Dot_ast.Number s
| Dot_ast.String s
| Dot_ast.Html s -> s
let edge _ = ()
end)
let parse_file f =
if Filename.check_suffix f ".gml" then
GmlParser.parse f
else
DotParser.parse f
module Components = Components.Make(G)
module Dfs = Traverse.Dfs(G)
end
open Gr
open Gr.G
let debug_graphEdGTK = ref false
let trace f x = try f x with e -> eprintf "TRACE: %s@." (Printexc.to_string e); raise e
let _ = GMain.Main.init ()
let graph = ref (Gr.parse_file Sys.argv.(1))
exception Choose of V.t
type t = V.t
type label = V.t
let label x = x
let string_of_label x = V.label x
let label_of_string x = x
(* [step_from n] computes the best `distance' for solving the
dictator's problem in the complex hyperbolic plane for [n]
dictators. In a half-plane, we have to use the distance
given by [step_from (2*n)] or, better, the distance given
by [step_from (2*max(3 n))]. *)
let step_from n =
ath (tan (pi_over_4 -. pi/.float(2*n)))
(* [hspace_dist_sqr turtle] computes the square of the distance
between the origin and the half-space in front of [turtle]. *)
let hspace_dist_sqr turtle =
let (ax, ay) = turtle.pos
and (dx, dy) = turtle.dir in
(* if ax*.dx +. ay*.dy < 0.0 then 0.0 else*)
begin
let ux = dy and uy = -.dx in
let alpha = ax*.ax +. ay*.ay
and beta = 2.0*.(ax*.ux +. ay*.uy) in
if beta = 0.0 then
alpha
else
begin
let gamma = (1.0 +. alpha)/.beta in
let delta = gamma*.gamma -. 1.0 in
let sol =
if beta > 0.0
then -.gamma +. sqrt(delta)
else -.gamma -. sqrt(delta) in
let (zx, zy) = translate (ax, ay) (ux*.sol, uy*.sol) in
zx*.zx +. zy*.zy
end
end ;;
let edge v w = mem_edge !graph v w || mem_edge !graph w v
let make_subgraph l =
let gl = create () in
List.iter (fun v -> add_vertex gl v) l;
List.iter
(fun v -> List.iter (fun w -> if edge v w then add_edge gl v w) l)
l;
(* TODO: efficacite *)
gl
let order_children l =
let gl = make_subgraph l in
let scc = Components.scc_list gl in
let order_component c =
let gc = make_subgraph c in
let v = match c with
| v :: l ->
List.fold_left
(fun m v -> if out_degree gc v < out_degree gc m then v else m)
v l
| [] ->
assert false
in
let l = ref [] in
Dfs.prefix_component (fun w -> l := w :: !l) gc v;
!l
in
let scc = List.map order_component scc in
List.flatten scc
let rlimit = 0.90
let rlimit_sqr = rlimit *. rlimit
module Model = struct
open Gobject.Data
let cols = new GTree.column_list
let name = cols#add string
let vertex = cols#add caml
let model = GTree.tree_store cols
let rows = Hashtbl.create 97
let add_vertex v =
let row = model#append () in
model#set ~row ~column:name (V.label v);
model#set ~row ~column:vertex v;
Hashtbl.add rows v row;
row
let add_edge_1 row_v w =
let row = model#append ~parent:row_v () in
model#set ~row ~column:name (V.label w)
let reset () =
Hashtbl.clear rows;
model#clear ();
iter_vertex
(fun v ->
let row = add_vertex v in
iter_succ (add_edge_1 row) !graph v)
!graph
let add_edge v w =
let row_v = Hashtbl.find rows v in
add_edge_1 row_v w;
if not is_directed then
let row_w = Hashtbl.find rows w in
add_edge_1 row_w v
end
let () = Model.reset ()
let model = ref Model.model
open GtkTree
(* Ouverture fenetre GTK *)
let window = GWindow.window ~border_width: 10 ~title:"GraphEd" ~position: `CENTER ()
(* une Verticale Box pour contenir le menu de la fenetre principale *)
let v_box = GPack.vbox ~homogeneous:false ~spacing:30 ~packing:window#add ()
(* la barre de Menu ajoutée dans la V_box *)
let menu_bar = GMenu.menu_bar ~packing:v_box#pack ()
let h_box = GPack.hbox ~homogeneous:false ~spacing:30 ~packing:v_box#add ()
let sw = GBin.scrolled_window ~shadow_type:`ETCHED_IN ~hpolicy:`NEVER
~vpolicy:`AUTOMATIC ~packing:h_box#add ()
let canvas = GnoCanvas.canvas ~aa:true ~width:(truncate w) ~height:(truncate h) ~packing:h_box#add ()
let canvas_root = canvas#root
let choose_root () =
try
iter_vertex (fun v -> raise (Choose v)) !graph;
Format.eprintf "empty graph@."; exit 0
with Choose v ->
v
let root = ref (choose_root ())
let load_graph f =
graph := parse_file f;
Model.reset ();
root := choose_root ()
module Vset = Set.Make(V)
let vset_of_list = List.fold_left (fun s x -> Vset.add x s) Vset.empty
module H = Hashtbl.Make(V)
(* table donnant pour chaque noeud sa profondeur et sa tortue *)
let pos = H.create 97
(* table des ellipses existantes *)
let ellipses = H.create 97
let tdraw_string_gtk v tor canvas =
let ellipse =
try
let item = H.find ellipses v in
item#parent#show();
item
with Not_found ->
let s = string_of_label v in
let (w,h) = (40,20) in
let noeud = GnoCanvas.group ~x:0.0 ~y:0.0 canvas in
let ellipse = GnoCanvas.ellipse
~props:[ `X1 ( float_of_int (-w/2)); `Y1 (float_of_int (-h/2));
`X2 (float_of_int (w/2)) ; `Y2 ( float_of_int (h/2)) ;
`FILL_COLOR "grey" ; `OUTLINE_COLOR "black" ;
`WIDTH_PIXELS 0 ] noeud
in
let texte = GnoCanvas.text ~props:[`X 0.0; `Y 0.0 ; `TEXT s;
`FILL_COLOR "blue"] noeud
in
let w2 = texte#text_width in
if w2 > float_of_int w
then
ellipse#set [ `X1 (-.( w2+.6.)/.2.); `X2 ((w2+.6.)/.2.)];
H.add ellipses v ellipse;
ellipse
in
tdraw_string_gtk tor ellipse;
ellipse
module H2 =
Hashtbl.Make
(struct
type t = V.t * V.t
let hash (v,w) = Hashtbl.hash (V.hash v, V.hash w)
let equal (v1,w1) (v2,w2) = V.equal v1 v2 && V.equal w1 w2
end)
let grey_edges = H2.create 97
let black_edges = H2.create 97
let draw_grey_edge vw tv tw canvas =
(* debug *)
if !debug_graphEdGTK
then
(
let (v,w)=
let (v,w) = vw in
(string_of_label v, string_of_label w) in
eprintf "tortue %s \t tortue %s@." v w
);
(* /debug *)
let p,l =
try
let _,l as pl = H2.find grey_edges vw in
l#show();
pl
with Not_found ->
let p = GnomeCanvas.PathDef.new_path () in
let l = GnoCanvas.bpath canvas
~props:[ `BPATH p ; `OUTLINE_COLOR "SlateGrey" ; `WIDTH_PIXELS 1 ] in
l#lower_to_bottom ();
H2.add grey_edges vw (p,l);
p,l
in
let (x,y) = let (x ,y ) = from_tortue tv.pos in ((float_of_int x),(float_of_int y)) in
let (x',y') = let (x',y') = from_tortue tw.pos in ((float_of_int x'),(float_of_int y')) in
let rapport = 1.95 in
GnomeCanvas.PathDef.reset p;
GnomeCanvas.PathDef.moveto p x y ;
GnomeCanvas.PathDef.curveto p ((x+. x')/.rapport) ((y +. y')/.rapport)
((x +.x')/.rapport) ((y +. y')/.rapport)
x' y';
l#set [`BPATH p]
let tdraw_edge_gtk vw t distance etapes canvas =
let line =
try
let l = H2.find black_edges vw in
l#show ();
l
with Not_found ->
let color = "black" in
let l = GnoCanvas.line canvas ~props:[ `FILL_COLOR color ;
`WIDTH_PIXELS 1; `SMOOTH true]
in
H2.add black_edges vw l;
l
in
tdraw_edge_gtk t distance etapes line
let color_change_intern_edge color node =
iter_edges
(fun _ w ->
try
let _,n = H2.find grey_edges (node,w) in
n#set [`OUTLINE_COLOR color]
with Not_found ->
try
let _,n = H2.find grey_edges (w,node) in
n#set [`OUTLINE_COLOR color]
with Not_found ->
()
)
!graph
let color_change_direct_edge color node =
iter_succ
(fun w ->
try
let n = H2.find black_edges (node,w) in
n#set [`FILL_COLOR color]
with Not_found ->
try
let n = H2.find black_edges (w,node) in
n#set [`FILL_COLOR color]
with Not_found ->
()
)
!graph node
let select = ref None
let is_selected_node v = match !select with
| None -> false
| Some (w,_) -> V.equal v w
let step = ref 0
let rec draw_graph depth noeud tortue canvas =
if !debug_graphEdGTK
then
(let (x,y) = tortue.pos in
Format.eprintf " hspace : %f\t pos : %f %f \tnoeud : %s@."
( hspace_dist_sqr tortue )x y(string_of_label noeud);
);
if hspace_dist_sqr tortue <= rlimit_sqr then
begin
H.replace pos noeud (depth, Some tortue);
tmoveto_gtk tortue;
(* draw label *)
let ellipse = tdraw_string_gtk noeud tortue canvas in
let sigs = ellipse#parent#connect in
let _ = sigs#event (drag_label noeud ellipse) in
let l = succ !graph noeud in
let l = List.filter (fun x -> not (H.mem pos x) ) l in
List.iter (fun w -> H.add pos w (depth+1, None)) l;
let l = order_children l in
let n = List.length l in
if n > 0 then
begin
let distance = step_from (max 3 n)
and angle = (if depth = 0 then 2. else 1.) *. pi /. (float_of_int n) in
let tortue = if depth = 0 then tortue else turn_right tortue ((pi -. angle) /. 2.) in
let _ = draw_edges noeud (depth+1) tortue distance angle canvas l in
()
end;
ellipse#parent#raise_to_top();
end
else if noeud <> !root
then
try
let ellipse = tdraw_string_gtk noeud tortue canvas in
ellipse#parent#hide();
iter_succ
(fun w ->
try
ignore (H.find pos w)
with Not_found ->
try
let n = H2.find black_edges (noeud,w) in
n#hide()
with Not_found ->
try
let n = H2.find black_edges (w,noeud) in
n#hide()
with Not_found ->
()
)
!graph noeud
(* H.remove pos noeud*)
with Not_found -> Format.eprintf"je devrai pas etre la@."
and draw_edges noeud depth t distance angle canvas= function
| [] ->
[]
| v :: l ->
let etapes = 10 in
let tv = tdraw_edge_gtk (noeud,v) t distance etapes canvas in
(*if hspace_dist_sqr t <= rlimit_sqr then H.add pos v (depth,tv);*)
let t = turn_left t angle in
let l = (v,tv) :: draw_edges noeud depth t distance angle canvas l in
draw_graph depth v tv canvas;
l
and drag_label noeud item ev =
begin match ev with
| `ENTER_NOTIFY _ ->
if not (is_selected_node noeud)
then begin
item#set [ `FILL_COLOR "steelblue" ];
color_change_intern_edge "blue" noeud ;
color_change_direct_edge "blue" noeud
end;
| `LEAVE_NOTIFY ev ->
if not (is_selected_node noeud)
then begin
let state = GdkEvent.Crossing.state ev in
if not (Gdk.Convert.test_modifier `BUTTON1 state)
then item#set [ `FILL_COLOR "grey" ; ];
color_change_intern_edge "SlateGrey" noeud ;
color_change_direct_edge "black" noeud;
begin match !select with
| None -> ()
| Some (n,i) -> begin
color_change_intern_edge "red" n ;
color_change_direct_edge "red" n
end
end;
end
| `BUTTON_RELEASE ev ->
item#parent#ungrab (GdkEvent.Button.time ev)
| `MOTION_NOTIFY ev ->
incr step;
let state = GdkEvent.Motion.state ev in
if Gdk.Convert.test_modifier `BUTTON1 state && !step mod 10 = 0 then
begin
let curs = Gdk.Cursor.create `FLEUR in
item#parent#grab [`POINTER_MOTION; `BUTTON_RELEASE] curs (GdkEvent.Button.time ev);
let ibounds = item#parent#get_bounds in
let z1 = to_tortue(truncate((ibounds.(0)+.ibounds.(2))/.2.),
truncate((ibounds.(1)+. ibounds.(3))/.2.)) in
let mx = GdkEvent.Motion.x ev in
let my = GdkEvent.Motion.y ev in
let z2 = to_tortue (truncate mx, truncate my) in
let tmp = !origine in
let (x,y) = drag_origin !origine z1 z2 in
origine := (x,y);
let tor = make_turtle !origine 0.0 in
if hspace_dist_sqr tor <= rlimit_sqr
then begin
draw tor canvas_root;
if !step mod 15 = 0 then
canvas_root#canvas#update_now ()
end else
origine := tmp
end
| `TWO_BUTTON_PRESS ev->
if (GdkEvent.Button.button ev) = 1
then selectionner_noeud noeud item;
| `BUTTON_PRESS ev ->
if (GdkEvent.Button.button ev) = 1
then deselectionner_noeud noeud item ;
if (GdkEvent.Button.button ev) = 3
then
begin
let loc_menu = GMenu.menu () in
let factory =
new GMenu.factory loc_menu in
ignore (factory#add_item " Ajouter un successeur" ~callback: (ajout_successeur noeud));
begin match !select with
| None -> ()
| Some (n,_) ->
if not(V.equal n noeud)
then begin
ignore (factory#add_item " Ajouter une arrête" ~callback: (ajout_arrete n noeud));
end
end;
loc_menu#popup
~button:3
~time:(GdkEvent.Button.time ev);
end
| _ ->
()
end;
true
and ajout_successeur noeud () =
let window = GWindow.window ~title: "Choix du nom du label" ~width: 300 ~height: 50 () in
let vbox = GPack.vbox ~packing: window#add () in
let entry = GEdit.entry ~max_length: 50 ~packing: vbox#add () in
entry#set_text "Label";
entry#select_region ~start:0 ~stop:entry#text_length;
window#show ();
let _ = entry#connect#activate
~callback: (fun () ->
let text = entry#text in
let label = label_of_string text in
let vertex = V.create label in
add_vertex !graph vertex;
add_edge !graph noeud vertex;
window#destroy ();
ignore (Model.add_vertex vertex);
Model.add_edge noeud vertex;
let tor = make_turtle !origine 0.0 in
draw tor canvas_root)
in
()
and ajout_arrete n1 n2 () =
if not( edge n1 n2)
then begin
add_edge !graph n1 n2;
Model.add_edge n1 n2;
let tor = make_turtle !origine 0.0 in
draw tor canvas_root
end
and selectionner_noeud noeud item=
begin
begin match !select with
| None -> ()
| Some (n,i) -> begin
i#set [ `FILL_COLOR "grey" ; ];
color_change_intern_edge "SlateGrey" n ;
color_change_direct_edge "black" n
end
end;
select := Some (noeud, item);
item#set [ `FILL_COLOR "red" ];
color_change_intern_edge "red" noeud ;
color_change_direct_edge "red" noeud
end
and deselectionner_noeud noeud item =
begin
if is_selected_node noeud
then
begin
item#set [ `FILL_COLOR "steelblue" ];
color_change_intern_edge "blue" noeud ;
color_change_direct_edge "blue" noeud
end
else
match !select with
| None -> ()
| Some (n,i) ->
begin
i#set [ `FILL_COLOR "grey" ; ];
color_change_intern_edge "SlateGrey" n ;
color_change_direct_edge "black" n;
(*
color_change_intern_edge "red" n ;
color_change_direct_edge "red" n
*)
end;
end;
select := None;
and draw tortue canvas =
H.clear pos;
canvas#hide();
draw_graph 0 !root tortue canvas;
(* H.iter (fun v ev -> if not (H.mem pos v) then ev#parent#hide ()) ellipses;
*)
(* draw intern edges *)
iter_edges
(fun v w ->
try
begin match H.find pos v, H.find pos w with
| (lv, Some tv), (lw, Some tw) ->
if abs (lw - lv) <> 1 && (lv <> 0 || lw <> 0)
then
begin
(* debug *)
if !debug_graphEdGTK
then
(Format.eprintf "tortue : %s\t\t\t tortue : %s@." (string_of_label v) (string_of_label w);
let (x ,y ) = from_tortue tv.pos
and (x',y') = from_tortue tw.pos in
Format.eprintf "pos x:%d y:%d \t pos x:%d y:%d@." x y x' y';
);
(* /debug *)
ignore(draw_grey_edge (v,w) tv tw canvas)
end
else
raise Not_found
| (_, None), _ | _, (_, None) ->
raise Not_found
end
with Not_found ->
begin
(* debug *)
if !debug_graphEdGTK then
Format.eprintf"Je vais tenter de détruire un edge@.";
(* /debug *)
try
let _,l = H2.find grey_edges (w,v) in l#hide();
(* debug *)
if !debug_graphEdGTK then Format.eprintf"J'ai effacé un grey edge@.";
(* /debug *)
with Not_found -> ();
try
let _,l = H2.find grey_edges (v,w) in l#hide();
(* debug *)
if !debug_graphEdGTK then Format.eprintf"J'ai effacé un grey edge@.";
(* /debug *)
with Not_found -> ();
end
)
!graph;
canvas#show()
let ajout_noeud () =
let window = GWindow.window ~title: "Choix du nom du label" ~width: 300 ~height: 50 () in
let vbox = GPack.vbox ~packing: window#add () in
let entry = GEdit.entry ~max_length: 50 ~packing: vbox#add () in
entry#set_text "Label";
entry#select_region ~start:0 ~stop:entry#text_length;
window#show ();
let _ = entry#connect#activate
~callback: (fun () ->
let text = entry#text in
let label = label_of_string text in
let vertex = V.create label in
add_vertex !graph vertex;
window#destroy ();
ignore (Model.add_vertex vertex);
let tor = make_turtle !origine 0.0 in
draw tor canvas_root)
in
()
let canvas_event ev =
(* Format.eprintf "toto suis-je empty ? : %b@." (is_empty !graph);
*)
begin match ev with
| `BUTTON_PRESS ev ->
if (GdkEvent.Button.button ev) = 1
then begin
match !select with
| None -> ()
| Some(noeud,item) ->
deselectionner_noeud noeud item ;
end;
if (GdkEvent.Button.button ev) = 3 (* && (is_empty !graph)*)
then
begin
let loc_menu = GMenu.menu () in
let factory =
new GMenu.factory loc_menu in
ignore (factory#add_item " Ajouter un noeud" ~callback: ajout_noeud);
loc_menu#popup
~button:3
~time:(GdkEvent.Button.time ev);
end
| _ ->
()
end;
true
let _ = canvas#root#connect#event (canvas_event)
let node_selection ~(model : GTree.tree_store) path =
let row = model#get_iter path in
let v = model#get ~row ~column: Model.vertex in
root := v;
let tortue =
origine := depart;
let (x,y) = from_tortue !origine in
moveto_gtk x y;
make_turtle !origine 0.0;
in
let l = canvas_root#get_items in
Format.eprintf "il y a %d elements dans le canvas @." (List.length l);
List.iter (fun v -> v#hide()) l;
draw tortue canvas_root
let add_columns ~(view : GTree.view) ~model =
let renderer = GTree.cell_renderer_text [`XALIGN 0.] in
let vc =
GTree.view_column ~title:"Nodes" ~renderer:(renderer, ["text", Model.name]) ()
in
ignore (view#append_column vc);
vc#set_sizing `FIXED;
vc#set_fixed_width 100;
(* vc#set_resizable true;*)
vc#set_sizing `GROW_ONLY;
view#selection#connect#after#changed ~callback:
begin fun () ->
List.iter
(fun p -> node_selection ~model p)
view#selection#get_selected_rows;
end
let _ = window#connect#destroy~callback:GMain.Main.quit
let treeview = GTree.view ~model:!model ~packing:sw#add ()
let () = treeview#set_rules_hint true
let () = treeview#selection#set_mode `MULTIPLE
let _ = add_columns ~view:treeview ~model:!model
(*let _ = treeview#misc#connect#realize ~callback:treeview#expand_all*)
let reset_table_and_canvas () =
let l = canvas_root#get_items in
List.iter (fun v -> trace v#destroy ()) l;
H2.clear grey_edges;
H2.clear black_edges;
H.clear ellipses;
H.clear pos;
origine := depart
let open_graph() =
let default d = function
| None -> d
| Some v -> v
in
let all_files () =
let f = GFile.filter ~name:"All" () in
f#add_pattern "*" ;
f
in
let graph_filter () =
GFile.filter
~name:"Fichier de graphes"
~patterns:[ "*.dot"; "*.gml" ] ()
in
let ask_for_file parent =
let dialog = GWindow.file_chooser_dialog
~action:`OPEN
~title:"Ouvrir un fichier"
~parent () in
dialog#add_button_stock `CANCEL `CANCEL ;
dialog#add_select_button_stock `OPEN `OPEN ;
dialog#add_filter (graph_filter ()) ;
dialog#add_filter (all_files ()) ;
let f = match dialog#run () with
| `OPEN ->default "<none>" dialog#filename
| `DELETE_EVENT | `CANCEL -> "<none>"
in
dialog#destroy ();
f
in
let fichier = ask_for_file window in
if fichier <> "<none>"
then
begin
load_graph fichier;
reset_table_and_canvas ();
let tortue =
let (x,y) = from_tortue !origine in
moveto_gtk x y;
make_turtle !origine 0.0
in
draw tortue canvas_root
end
let new_graph () =
graph := create ();
model := Model.model;
Model.reset();
reset_table_and_canvas ()
let create_menu label menubar =
let item = GMenu.menu_item ~label ~packing:menubar#append () in
GMenu.menu ~packing:item#set_submenu ()
let print msg () =
print_endline msg;
flush stdout
(* le menu file : la description puis l'ajout au menu_bar *)
let menu_files =
[
`I ("_New Graph", new_graph);
`I ("_Open Graph", open_graph);
`I ("_Save Graph", print "todo save graph");
`I ("Save Graph _As ...", print "todo save graph as...");
`S;
`I ("_Quit", GMain.Main.quit )
]
let menu =
create_menu "File" menu_bar
let _ = GToolbox.build_menu menu ~entries:menu_files
(* la zone d'affichage du graph, le canvas *)
let tortue =
let (x,y) = from_tortue !origine in
moveto_gtk x y;
make_turtle !origine 0.0
let () = canvas#set_scroll_region 0. 0. w h
(* l'affichage de la fenetre principale *)
let () = window#show ()
let _ = draw tortue canvas_root
let () = GMain.Main.main ()
|