On Wed, 26 Sep 2001, Mattias Waldau wrote:
> When I look at one of the papers, you get the impression that an
> imperative implementation is one to two magnitudes faster, is that
> right?  (Speed is irrelevant right now for me.)

This depends on the operation and the size of your graph. Some operations
should be nearly as fast (e.g. in the POMAP-case, insertion of elements),
others might run slower by this considerable amount (e.g. traversing
nodes - requires traversal and lookups in both edge sets and the node
set). I don't have any direct comparison to an imperative version so
this is just an estimate. It would be really interesting to have an
efficient imperative graph library in OCaml, too.

Regards,
Markus Mottl

-- 
Markus Mottl                                             markus@oefai.at
Austrian Research Institute
for Artificial Intelligence                  http://www.oefai.at/~markus
-------------------
Bug reports: http://caml.inria.fr/bin/caml-bugs  FAQ: http://caml.inria.fr/FAQ/
To unsubscribe, mail caml-list-request@inria.fr  Archives: http://caml.inria.fr