1. Add to the Graph class a method using the breadth first search strategy to do what the dfs methods do: i.e.,the component containing the start vertex should be traversed and a message should be ouput that states if the graph is or is not connected. Remember, in BFS, the stack is replaced by a queue. You can use our Queue class or write your own. 2. (Add to the class Graph a method boolean isPath (...) that determines if there is path from vertex start to vertex des. This will require the pred array I suggest that in the driver class, you open a text file with several pairs of vertices and invoke isPath in each case. If a path exists, it should be printed out. Use the graphs provided in the dfs file to check that your bfs algorithm works. Submit 2 files: the altered Graph class and driver. Of course, if you write your own Queue class, submit that too. on the file there is thegraph class, the queue class u can use and the driver class So u will only be changing the graph and the driver class
## Deliverables
THis must be done by sunday , The first assigment is a must, the adding a boolean is path is a big plus in winning the bid but not a must
## Platform
windows xp