# Union Find data structure 1.0

OS : Windows / Linux / Mac OS / BSD / Solaris

Script Licensing : Other Free / Open Source License - Python License

Created : Feb 15, 2007

Downloads : 2

Thank you for voting...

## This script implements the Union Find data structure ...

This script implements the union_find_data_structure by Josiah Carlson and algorithm. This data structure allows one to find out which set an object belongs to, as well as join two sets.

The algorithm's performance, given m union/find operations of any ordering, on n elements has been shown to take log* time per operation, where log* is pronounced log-star, and is the INVERSE of what is known as the Ackerman function, which is given below:

A(0) = 1

A(n) = 2**A(n-1)

The algorithm's performance, given m union/find operations of any ordering, on n elements has been shown to take log* time per operation, where log* is pronounced log-star, and is the INVERSE of what is known as the Ackerman function, which is given below:

A(0) = 1

A(n) = 2**A(n-1)

**Union Find data structure 1.0 scripting tags:**elements, union find data structure, log, tree algorithm.

**What is new in Union Find data structure 1.0 software script?**- Unable to find Union Find data structure 1.0 news.

**What is improvements are expecting?**Newly-made Union Find data structure 1.1 will be downloaded from here. You may download directly. Please write the reviews of the Union Find data structure. License limitations are unspecified.