disjoint-set: Persistent disjoint-sets, a.k.a union-find.
|Dependencies||base (>=3 && <5), containers (>=0.3), mtl (>=2), transformers (>=0.3) [details]|
|Author||Maxwell Sayles, Myles Maxfield|
|Source repo||head: git clone git://github.com/maxwellsayles/disjoint-set.git|
|Uploaded||by MaxwellSayles at Mon Oct 15 16:21:59 UTC 2012|
|Downloads||988 total (11 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI
This is a persistent data structure for disjoint sets.
The algorithm is described in "Introduction to Algorithms" by Cormen, et al. The implementation here uses both union by rank and path compression. We incur an O(logn) overhead because of the use of persistent maps.
Data.IntDisjointSet is as strict as possible.
For package maintainers and hackage trustees