BFS and DFS Assignment

The paths between nodes are represented as an nxn matrix, where n is the number of nodes. Each slot in the matrix represent the weight of the path between corresponding nodes. Zero and Negative values represents non-exiting path.

The matrix usually stored in a file in the following format, where the fist line representing the node names, and subsequence lines representing the weight between the any two nodes between the corresponding row and column.

A B C D E F

0 1 2 0 2 1

1 0 0 0 1 1

You are required to implement a JAVA program that:

1. Prompts the user to enter the name of the file containing the matrix, the name of the starting node, and the name of the ending node.

2. Find and display a path (preferably shortest path ) between the starting node and the ending node by Breath First Search

3. Find and display a path (preferably shortest path ) between the starting node and the ending node by Depth First Search

4. Comment each method of what it does and every line that isn't easily understood

Hints: it would be easier to handle your graph if each node is encapsulated with at least: node name, distance from the source node, and the preceding node name on the path for that distance