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-san-francisco.txt ...
Preparing world model ...
World model completed.
Start location: 434686038
End location: 1083221086

Looking for a path from 434686038 to 1083221086.
Executing breadth-first search algorithm ...
Algorithm complete.
Path length: 33
Path cost: 1.50594
Locations explored (green nodes):   294
Locations in fringe (yellow nodes): 38


Start location: 434686038
End location: 1083221086

Looking for a path from 434686038 to 1083221086.
Executing Dijkstra's algorithm ...
Algorithm complete.
Path length: 35
Path cost: 1.50379
Locations explored (green nodes):   205
Locations in fringe (yellow nodes): 17


Start location: 434686038
End location: 1083221086

Looking for a path from 434686038 to 1083221086.
Executing A* algorithm ...
Algorithm complete.
Path length: 35
Path cost: 1.50379
Locations explored (green nodes):   111
Locations in fringe (yellow nodes): 11



Looking for a path from 434686038 to 1083221086.
Executing Alternative Route Search algorithm ...
Algorithm complete.
Path length: 33
Path cost: 1.50594
Locations explored (green nodes):   154
Locations in fringe (yellow nodes): 17