Resolution:
standard / ## Figure 2.
An example of the steps involved in the algorithm called Union-Find by rank with path
compression [19,20]. Edges (first column, in red) are examined online. The disjoint-sets data structure,
represented by trees (third column) and implemented using the parent array (second column), is consequently modified. The two vertices of the current edge
of interest are colored in red.
Miele |