Modify the program from Assignment #19 so that the graph is now a weighted directed graph. The "weight" portion will be the approximate distances (in feet) between the campus locations.
Determine the shortest path to visit all buildings on campus, starting from the parking lot. Output the order each building should be visited to a text file.