# UnionFind.QuickUnion

<!-- div class="doc-container" -->

<!-- div -->


<!-- div -->

<h3 id="connectedvaluea-valueb"><code>connected(valueA, valueB)</code></h3>

Are the `2` verticies connected?

#### Arguments
1. `valueA` *(&#42;)*: the first vertex to compare
2. `valueB` *(&#42;)*: the second vertex to compare

#### Returns
*(boolean)*: true if the verticies are connected, false if not

---

<!-- /div -->

<!-- /div -->

<!-- div -->


<!-- div -->

<h3 id="constructorvalues"><code>constructor([values])</code></h3>



#### Arguments
1. `[values]` *(Array)*: an array of verticies to add to the set

---

<!-- /div -->

<!-- /div -->

<!-- div -->


<!-- div -->

<h3 id="count"><code>count</code></h3>

(number): The number of sets

---

<!-- /div -->

<!-- /div -->

<!-- div -->


<!-- div -->

<h3 id="findvalue"><code>find(value)</code></h3>

Find the id for a value

#### Arguments
1. `value` *(&#42;)*: the value to lookup

#### Returns
*(&#42;)*: the identity of the set containing the item

---

<!-- /div -->

<!-- /div -->

<!-- div -->


<!-- div -->

<h3 id="sets"><code>sets()</code></h3>

Returns a `2`D array of the unique sets and the values in those sets

#### Returns
*(Array)*: a `2`D array containing the disjoint sets

---

<!-- /div -->

<!-- /div -->

<!-- div -->


<!-- div -->

<h3 id="unionvaluea-valueb"><code>union(valueA, valueB)</code></h3>

Join the verticies if not alredy in the same set

#### Arguments
1. `valueA` *(&#42;)*: the first vertex to connect
2. `valueB` *(&#42;)*: the second vertex to connect

---

<!-- /div -->

<!-- /div -->

<!-- /div -->