Union-Find data structure implementation in Python
Implementation of the Union-Find data structure in Python.
Data is divided into different groups (“partitions”). Each group has a name, and a set of objects. Over this setup, we want to support two operations:
- find(x): Return the name of the group where x belongs to.
- union(g1, g2): Given two groups, merge them into one. The new meta-group contains all the elements from g1 and g2.
>>> space = UnionFindSpace( Partition("letters", "abcdef"), Partition("numbers", range(5)), ) >>> space.find("a") letters >>> space.find(1) numbers >>> partition = space.union("letters", "numbers") >>> partition.name letters_numbers # It's possible to indicate the name of the group >>> partition = space.union("letters", "numbers", "alpha") >>> partition.name alpha
In order to start working or testing with this repository, you’ll need to create and activate a new virtual environment. Respectively, the commands are the following ones
$ python3 -m venv env $ source env/bin/activate
After that you can setup the environment with:
$ make install-dev $ make test
Make sure that:
- The test pass successfully
- The code is properly formatted (this can be checked with make lint and corrected with make format).
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size pyuf-0.1.2-py3-none-any.whl (3.7 kB)||File type Wheel||Python version py3||Upload date||Hashes View|
|Filename, size pyuf-0.1.2.tar.gz (2.8 kB)||File type Source||Python version None||Upload date||Hashes View|