disjoint-sets-st: Imperative ST/IO based disjoint set data structure.
Downloads
- disjoint-sets-st-0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.1 |
|---|---|
| Dependencies | array (>=0.3.0.1), base (>=4 && <5) [details] |
| License | BSD-3-Clause |
| Copyright | Copyright (C) 2013 Petr Pudlák |
| Author | Petr Pudlák |
| Maintainer | Petr Pudlák <petr.mvd@gmail.com> |
| Category | Data Structures |
| Home page | http://github.com/ppetr/disjoint-sets-st/ |
| Bug tracker | http://github.com/ppetr/disjoint-sets-st/issues |
| Source repo | head: git clone git://github.com/ppetr/disjoint-sets-st.git |
| Uploaded | by PetrPudlak at 2013-05-29T19:10:10Z |
| Distributions | NixOS:0.1 |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 2008 total (7 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |
Readme for disjoint-sets-st-0.1
[back to package description]disjoint-sets-st
An imperative, high-performance disjoint set data structure with nearly-constant time complexity. It can be used with any mutable arrays, most often with IOUArray and STUArray.
Contact Information
Contributions and bug reports are welcome!
-Petr Pudlák
License
Licensed under the 3-clause BSD license.