Connected Components An undirected graph can be separated into connected components. A connected com ponent is a set of vertices for which 1) every two vertices in the set are connected by a path, and (2) no edge connects a vertex inside the set to a vertex outside the set Give an O(V E)-time algorithm for dividing an undirected graph into connected components, that is, for finding all of the connected components in the graph