Write a program to label the connected components for an undirected graph.

In other words, all vertices of the first component are given the first component’s label, all vertices of the second component are given the second 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 equivalence class will be connected. Use the UNION/FIND implementation from Section 6.2 to implement equivalence classes.