https://github.com/ppetr/disjoint-sets-st

An imperative, high-performance disjoint set data structure.
https://github.com/ppetr/disjoint-sets-st

Last synced: over 1 year ago
JSON representation

An imperative, high-performance disjoint set data structure.

• Host: GitHub
• URL: https://github.com/ppetr/disjoint-sets-st
• Owner: ppetr
• License: other
• Created: 2013-05-29T12:47:01.000Z (about 13 years ago)
• Default Branch: master
• Last Pushed: 2013-05-29T14:05:46.000Z (about 13 years ago)
• Last Synced: 2024-04-24T13:16:44.866Z (about 2 years ago)
• Language: Haskell
• Size: 113 KB
• Stars: 1
• Watchers: 4
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.markdown
  • License: LICENSE.markdown

Awesome Lists containing this project

README

          
disjoint-sets-st

================

[![Build Status](https://secure.travis-ci.org/ppetr/disjoint-sets-st.png?branch=master)](http://travis-ci.org/ppetr/disjoint-sets-st)

An imperative, high-performance [disjoint set data structure](https://en.wikipedia.org/wiki/Disjoint-set_data_structure) with [nearly-constant](https://en.wikipedia.org/wiki/Ackermann_function#Inverse) time complexity. It can be used with any [mutable arrays](http://hackage.haskell.org/packages/archive/array/latest/doc/html/Data-Array-MArray.html#t:MArray), 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.