Hello, 2010/12/13 Eray Ozkural <examach...@gmail.com>
> Oww, is the imperative implementation using hash tables or maps then? > Imperative implementations use hash tables (except the ones called Matrix which use arrays of bitvectors) while persistent implementations use maps. > Shouldn't be too hard to plug your own in ocamlgraph if needed. > OcamlGraph is designed for such an use : each algorithm provided by the library is a functor parameterized by the required graph operations (iterators over vertices and edges, ...). Thus you can provide your own in an easy way. Hope this helps, Julien Signoles
_______________________________________________ Caml-list mailing list. Subscription management: http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list Archives: http://caml.inria.fr Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs
