Welcome to CS 106B Trailblazer!
This program searches for paths through graphs
representing roadmaps. It demonstrates several graph 
algorithms for finding paths, such as breadth-first
search (BFS), Dijkstra's Algorithm, and A* search,
You can use alternate route to find a different path.

Loading world from map-usa.txt ...
Preparing world model ...
World model completed.

Loading world from map-stanford.txt ...
Preparing world model ...
World model completed.
Start location: 65427082
End location: 612016919

Looking for a path from 65427082 to 612016919.
Executing breadth-first search algorithm ...
Algorithm complete.
Path length: 29
Path cost: 6.24495
Locations explored (green nodes):   1261
Locations in fringe (yellow nodes): 53


Start location: 65427082
End location: 612016919

Looking for a path from 65427082 to 612016919.
Executing Dijkstra's algorithm ...
Algorithm complete.
Path length: 39
Path cost: 4.98128
Locations explored (green nodes):   949
Locations in fringe (yellow nodes): 47


Start location: 65427082
End location: 612016919

Looking for a path from 65427082 to 612016919.
Executing A* algorithm ...
Algorithm complete.
Path length: 39
Path cost: 4.98128
Locations explored (green nodes):   231
Locations in fringe (yellow nodes): 43



Looking for a path from 65427082 to 612016919.
Executing Alternative Route Search algorithm ...
Algorithm complete.
Path length: 43
Path cost: 5.02612
Locations explored (green nodes):   387
Locations in fringe (yellow nodes): 92