archive-gh-me/javascript-algorithms
1
0
Fork 0
mirror of https://github.com/trekhleb/javascript-algorithms.git synced 2025-12-08 19:06:00 +00:00
Code Issues Projects Releases Wiki Activity
javascript-algorithms/src/data-structures/disjoint-set
History
m-maksyutin 36e0bfeb32 Fix the value returned by DisjointSet union (#81) 
* Fix LinkedList

* Fix the prepend method for the LinkedList

* Fix the remove method for the MinHeap

* Correct a comment

* Fix BST removal method

* Fix the findEdge method of the graph

* Fix the value returned by DisjointSet union
2018-06-27 16:22:54 +03:00
..
__test__
Add disjoint set.
2018-05-04 06:18:05 +03:00
DisjointSet.js
Fix the value returned by DisjointSet union (#81)
2018-06-27 16:22:54 +03:00
DisjointSetItem.js
Add disjoint set.
2018-05-04 06:18:05 +03:00
README.md
Update READMEs.
2018-05-21 16:48:21 +03:00

README.md

Disjoint Set

Disjoint-set data structure (also called a union–find data structure or merge–find set) is a data structure that tracks a set of elements partitioned into a number of disjoint (non-overlapping) subsets. It provides near-constant-time operations (bounded by the inverse Ackermann function) to add new sets, to merge existing sets, and to determine whether elements are in the same set. In addition to many other uses (see the Applications section), disjoint-sets play a key role in Kruskal's algorithm for finding the minimum spanning tree of a graph.

disjoint set

MakeSet creates 8 singletons.

disjoint set

After some operations of Union, some sets are grouped together.

References