///////
//
// Student: Russell Lowke
//     T.F: Francis Crick
// Unit Ten, pencil-and-paper - question 3 [worth 2pts],  8/13/2002
//
// Use Dijkstra's algorithm to determine the shortest distance from Boston to
// every other city in the graph.
//
// Make a table showing the order in which the cities are marked "finished"
// and minimum distance to each.
