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-small.txt ...
Preparing world model ...
World model completed.

Looking for a path from Chem to Clock.
Executing breadth-first search algorithm ...
Algorithm complete.
Path length: 5
Path cost: 0.433
Locations visited: 15

Looking for a path from Cogen to Clock.
Executing breadth-first search algorithm ...
Algorithm complete.
Path length: 5
Path cost: 0.64
Locations visited: 21

Looking for a path from Cogen to Clock.
Executing Dijkstra's algorithm ...
Algorithm complete.
Path length: 6
Path cost: 0.524
Locations visited: 20

Looking for a path from Cogen to Clock.
Executing A* algorithm ...
Algorithm complete.
Path length: 6
Path cost: 0.524
Locations visited: 6

Looking for a path from Cogen to Clock.
Executing Alternative Route Search algorithm ...
Algorithm complete.
Path length: 6
Path cost: 0.616
Locations visited: 10