///////
//
// 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.

			Start							   End
Boston		0
New York	ƒ	200
Washington	ƒ	ƒ	250
Atlanta		ƒ	ƒ	ƒ	600
O'Hare		ƒ	900	800	750	700
Denver		ƒ	ƒ	ƒ	ƒ	ƒ	1200
Seattle		ƒ	ƒ	ƒ	ƒ	ƒ	ƒ	 900
San Jose	ƒ	ƒ	ƒ	ƒ	ƒ	2100 1000 1000
L.A.		ƒ	ƒ	ƒ	ƒ	ƒ	2000 2000 2000 400