Optimal Path Search Program
	*Program ShortestPath1 will find out the shortest path between a given source and  destination from a defined traffic diagram using Dijkstras algorithm. *Number along each path denotes a traffic load, a red number for downstream from higher index terminal to a lower indexed one, and a blue number for upstream. The load can be uniformly changed by moving Traffic Slider at right frame, and once it exceeds 100, the path will be considered as overloaded, and the linkage will be broken. *In addition to a C++ compiler, this program needs Trolltec Qt to make the GUI from souce codes.
			*Souce code:  shortestPath1GUI.zip (122kb) 7 C++ and header files, 1 executable (ShortestPath1), 1 Qt project file (s14) *Result examples: PathSearch.ppt (1.4MB)
				Fig. The shortest upstreaming path between terminals 2 and 13 is found to be 2->1->6->9->13 with the total load of 167.