AStar greedy and Dijkstra's shortest path implemented using actual linear distance between cities as heuristics.