You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardexpand all lines: src/com/jwetherell/algorithms/data_structures/DisjointSet.java
+7-7
Original file line number
Diff line number
Diff line change
@@ -3,14 +3,14 @@
3
3
/**
4
4
* In computer science, a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that keeps track of a set of
5
5
* elements partitioned into a number of disjoint (non-overlapping) subsets.
6
-
*
7
-
* It supports two useful operations:
6
+
* <p>
7
+
* It supports two useful operations:<br>
8
8
* Find: Determine which subset a particular element is in. Find typically returns an item from this set that serves as its "representative"; by comparing the
9
-
* result of two Find operations, one can determine whether two elements are in the same subset.
* In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed. Like a set, it contains members (also called elements, or terms). The number of elements
9
+
* (possibly infinite) is called the length of the sequence. Unlike a set, order matters, and exactly the same elements can appear multiple times at different positions in the sequence.
0 commit comments