Advanced Group Assignment:

Design the depth-first search, breadth-first search and the shortest path algorithms for your graph. Allow the user to choose the origin and the destination, as well as which algorithm will be used.

The three graph algorithms.

You can find a concise description of the three graph algorithms in this pdf file.

The neighboring states.

You can find this information on any map of the USA. You can extract the data from the file capitals.txt

Alternately, you may use the code (as is or modified) in the file Capitals.java to initialize your data.

Computing the distances.

You may use the following hints to compute the distances between cities.