🚀 go-pugleaf

Vào 11:38:05 UTC+8 Thứ năm, ngày 17 tháng tám năm 2006, Henry Bigelow đã viết:
> hi,
> 
>   does anyone know whether cliquetree.ml, a contrib to ocamlgraph, is
> working?  it seems like it contains bugs (see the demo below), and it
> hasn't been updated for a few years.
> 
> more generally, for those who want a graph library in ocaml, is
> ocamlgraph the definitive one?  and, what do you use for max
> cardinality search and clique tree construction?
> 
> thanks in advance for any hints.
> 
> sincerely,
> 
> henry
> 
> 
> # #load "/home5/bigelow/src/ocamlgraph-0.97/graph.cma";;
> # open Graph;;
> # module G = Imperative.Graph.Abstract (struct type t = string end);;
> # module CT = Cliquetree.CliqueTree(G);;
> # let g = G.create ();;
> val g : G.t = <abstr>
> # let v1 = G.V.create "A";;
> val v1 : G.V.t = <abstr>
> # let v2 = G.V.create "B";;
> val v2 : G.V.t = <abstr>
> # G.add_vertex;;
> - : G.t -> G.vertex -> unit = <fun>
> # G.add_vertex g v1;;
> - : unit = ()
> # G.add_vertex g v2;;
> - : unit = ()
> # G.add_edge;;
> - : G.t -> G.vertex -> G.vertex -> unit = <fun>
> # G.add_edge g v1 v2;;
> - : unit = ()
> # CT.mcs_clique;;
> - : G.t -> G.V.t list * CT.CliqueTree.t * CT.CliqueTree.V.t = <fun>
> # CT.mcs_clique g;;
> Exception: Failure "last not set".
> # CT.is_chordal g;;
> Exception: Failure "last not set".

Hi Henry,
I got the same problem with cliquetree anhd MCS-M algorithm when using ocamlgraph. Did you fix that errors?

Hope anyone can help.
thanks a lot!