abchilders / algorithms Goto Github PK

An idea: instead of computing the shortest path on each individual run of the program, one might also write the shortest paths calculated throughout all program executions to a file, and then load them before asking the user for input (the idea of saving to/loading from file h/t acarteas).

This isn't a pressing issue, but implementing this might make the program faster as more shortest paths were computed in the long run.

Currently, the program is running at a Tier 1 level (outputs only how long it takes to get from point A to point B). When the user inputs an invalid campus building abbreviation (e.g. MUSC, which doesn't exist), the program simply outputs that the travel time is 0 minutes and 0 seconds. I'd like to catch invalid user input before calculating anything so that I can let the user know that their route doesn't exist, rather than showing that the estimated time is 0 seconds (as it would be if one were traveling from, say, Alder to Chinquapin, which are under the same Canyon Complex node).