Java Reference
In-Depth Information
component's label, and so on. Your algorithm should work by defining any
two vertices connected by an edge to be members of the same equivalence
class. Once all of the edges have been processed, all vertices in a given equiv-
alence class will be connected. Use the UNION/FIND implementation from
Section 6.2 to implement equivalence classes.
