QuickFind

When construct a QuickFind, we pass $n$ as the capacity of the quick find. We mark the elements in quick find from $0$ to $n-1$ (inclusive).

Different algorithms of quick find bring us different growth of the cost, see below:

Type	`connected(p, q)`	`union(p, q)`
`tango.type.QuickFind(N)`	$\text{O}(1)$	$\text{O}(N)$
`tango.type.WeightedQuickFind(N)`	$\text{O}(\ln N)$	$\text{O}(\ln N)$

Returns true iff $p$ is connected with $q$ , otherwise false.

Gets the number of components which are not connected with each other.

Unions $p$ with $q$ and returns the count() after union.

results matching ""