If you use the first edition of the textbook, follow the reading material
in orange. If you use the second edition,
follow the reading material in brown.
pages 362-371 (Section 9.3)
pages 557-566 (Section 12.3)
Give an algorithm which computes the number of connected components
of a simple undirected graph.