CHAPTER 24 Graphs and Applications Objectives To model real-world problems using graphs and explain the Seven Bridges of Knigsberg problem (24. To...

(using java language with netbeans IDE)

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 below gives the examples of two files for their corresponding graphs.

Your program should prompt the user to enter the name of the file, then it should read data from the file, create an instance g of UnweightedGraph, invoke g.printEdges() to display all edges, and invoke dfs() to obtain an instance tree of AbstractGraph.Tree. If tree.getNumberOfVerticesFound() is the same as the number of vertices in the graph, the graph is connected. Here is a sample run of the program based on the Figure below.

in the file i attached it gives an example of the program i want, its 24.1, (test whether a graph is connected) on page 52 - 53