Reading material
Pages 557-570 (Section 12.3)
Additional material
Graph traversals in
PostScript
and
PDF
Question
Design an algorithm that, given a simple undirected graph, returns the number of connected components of the graph.