Pathfinder

This is Assignment #6 of Stanford's CS106B class last Spring Quarter 2011.

This is an assignment on graphs. It includes an implementation of Dijkstra's shortest path algorithm and of Kruskal's minimum spanning tree algorithm.

Here is a screen-shot of the minimum spanning tree of the graph data in the file "USA.txt" (included in the project).

You can play with this app by downloading the .exe file along with the other files here.

You can download the source files here.
You can download my code here.

You can download my code here.

You can download the problem specification here here.

Have fun!!!