union-find-array provides an ST based implementation of Tarjan's disjoint set forests, using mutable arrays storing indices instead of references internally. There is also a pure, immutable version of the data structure, which is useful for querying the result of a union find construction.
-
Notifications
You must be signed in to change notification settings - Fork 4
ST based union find data structure
License
haskell-rewriting/union-find-array
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
ST based union find data structure
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published