On Wednesday, July 27, 2011 9:22:16 PM UTC+1, Guillaume Yziquel wrote: > I'm wondering if people on this list may have any insight as to how > implement a "poset-find" datastructure much like a union-find > datastructure.
What you want is known as "dynamic transitive closure" or, more precisely, "incremental transitive closure." See, for example, http://scholar.google.co.uk/scholar?cluster=2214623839872244490 as a starting point. -- 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
