The latest version of disjoint-set is 0.2-0.
disjoint-set
Version 0.1 revision 0 uploaded by MaxwellSayles.
Package meta
- Synopsis
- Persistent disjoint-sets, a.k.a union-find.
- Description
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.
- Author
- Maxwell Sayles <maxwellsayles@gmail.com>
- Bug reports
- n/a
- Category
- Data
- Copyright
- n/a
- Homepage
- https://github.com/maxwellsayles/disjoint-set
- Maintainer
- Maxwell Sayles <maxwellsayles@gmail.com>
- Package URL
- n/a
- Stability
- stable