Write a program that reads a graph from a file and determines whether the graph is connected. The first line in the file contains a number that indicates the number of vertices (n). The vertices are labeled as 0, 1, . . . , n−1. Each subsequent line, with the format u v1 v2 ..., describes edges (u, v1), (u, v2), and so on. Figure 28.21 gives the examples of two files for their corresponding graphs.

Transcribed Image Text:

Fi le Fi le 6 0 12 0 123 103 103 2034 312 45 203 3012 2 3 4235 45 534 5 5 4 5 (a) (b)