I just stumbled upon the interesting subject of dynamic graph algorithms, those that can incrementally alter their output given small changes to the graph (i.e. adding and removing edges and/or vertices). Topology trees and sparsification are related subjects. I'm wondering if anyone has done any work on this kind of stuff using OCaml? For some reason, there seems to be surprisingly little research on these topics...
-- Dr Jon Harrop, Flying Frog Consultancy Ltd. http://www.ffconsultancy.com -- Caml-list mailing list. Subscription management and archives: https://sympa-roc.inria.fr/wws/info/caml-list Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs
