CIS 121 Final Project

Fall 2008

by Leftheris Kaleas

This program takes in a specially formatted text file of roads and given a start point and an end point, will find the shortest path between them, as well as the minimum spanning tree of the graph. It then plots both of the answers on Google Maps. Here is the source code:

Select some different text files below to see what the program does for different sized data sets.


Current Text Displayed: roadSet1Formatted.txt

Shortest Path


Minimum Spanning Tree