Answer
Devising an algorithm based on breadth-first search for finding the connected components of a graph.
Work Step by Step
--Add an instruction to the BFS algorithm to mark each vertex as it is encountered.
-When BFS terminates we have found (all the vertices of) one component of the graph.
- Repeat, starting at an unmarked vertex, and continue in this way until all vertices have been marked.
