Disjoint set data structure implementation for Python
Project description
disjoint-set
DisjointSet (a.k.a. union–find data structure or merge–find set) implementation for Python.
Prerequisites
The only requirement is having Python 3.8+ installed, you can verify this by running:
$ python --version
Python 3.8.16
Installation
pip install disjoint-set
You can verify you're running the latest package version by running:
>>> import disjoint_set
>>> disjoint_set.__version__
'0.7.4'
Usage
>>> from disjoint_set import DisjointSet
>>> ds = DisjointSet()
>>> ds.find(1)
1
>>> ds.union(1,2)
>>> ds.find(1)
2
>>> ds.find(2)
2
>>> ds.connected(1,2)
True
>>> ds.connected(1,3)
False
>>> "a" in ds
False
>>> ds.find("a")
'a'
>>> "a" in ds
True
>>> list(ds)
[(1, 2), (2, 2), (3, 3), ('a', 'a')]
>>> list(ds.itersets())
[{1, 2}, {3}, {'a'}]
Contributing
Feel free to open any issues on github.
Authors
License
This project is licensed under the MIT License - see the LICENSE.md file for details
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
disjoint_set-0.7.4.tar.gz
(5.2 kB
view hashes)
Built Distribution
Close
Hashes for disjoint_set-0.7.4-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 04225e87af9c05c8e6c8815311e1dc82f262cd89daa23655fc10c11727f1be57 |
|
MD5 | 7b2e45a5308214e72fee32d909b226dc |
|
BLAKE2b-256 | a1a2fe3c43eed49d2b136c509ac94eac1255ab0ce82d4bed5ffae9faf27e927d |