BFS is already done. Please do DFS and Shortest paths using txt file. Please see example below.

Thanks

Develop an interactive program to implement following operations on a graph:

Create a graph From a file

Display Graph information (adjacency Lists)

Text (Display adjacency lists)

Traverse the graph (BFS) (prompt for starting vertex)

Traverse the graph (DFS) (prompt for starting vertex)

Find all shortest paths (prompt for starting vertex)

Display Graph

Program should create a new graph using adjacency list representation of graph. Allow any graph with up to 50 nodes created (define an array of 50 elements for header nodes). Graph nodes are numbered from 1-N, where N is the number of nodes in the graph. The information about a graph should be read from a text file with the following layout:

N Number of nodes in the graph

i j w an edge exists between nodes i and j and weight is w

..

The rest of the file contains more edge information.

7

1 2 7

1 3 4

1 4 2

2 3 1

3 4 1

3 5 2

3 6 2

3 7 5

5 7 3

6 7 1

Once graph is created report graph information and allow the user select the other options.

After graph is loaded display adjacency lists

If BFS or DFS is selected prompt the user for the starting node,

When option for shortest path is selected, prompt the user for the starting point. Display the length of the shortest paths and the path itself as a sequence of edges.

Graph operations Adjacency LIst Depth First Search: Breadth st Search: Shortest Pathso iA: Vertex B: Shortest Path CPrevious)