Shortest Path Algorithm
- Start with a city of origin and make a list of the cities that can be reached in one step.
- Order this list by cost, with the least costly city listed first.
- Determine the cites reachable from the first destination and add the costs of travel for each to the cost of the first leg.
- Put a loop around the operation.