persistent-equivalence: Persistent equivalence relations (aka union-find)
This is a semi-persistent data structure for equivalence relations (known in the imperative world as union-find or disjoint set union). It exhibits optimal performance when used in a linear pattern, but degrades when other access patterns are used.
The basic idea is as given by Conchon and Filliatre in their 2007 paper, "A persistent union-find data structure." Unlike the implementation given in the paper, this version is safe with multiple threads, but does not optimize for backtracking.
Version 0.2 removes unnecessary atomic operations when doing updates that are never semantically meaningful, hopefully leading to better scalability in a parallel setting.
|Versions [RSS] [faq]||0.1, 0.1.1, 0.2, 0.3|
|Dependencies||array (==0.3.*), base (>=3 && <5), diffarray (==0.1.*) [details]|
|Author||Chris Smith <firstname.lastname@example.org>|
|Maintainer||Chris Smith <email@example.com>|
|Uploaded||by ChrisSmith at 2011-06-08T16:17:41Z|
|Downloads||2725 total (18 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs uploaded by user
Build status unknown [no reports yet]