Welcome to CS 106X Pathfinder!
This program searches for paths through graphs
representing maps, mazes, and rocky terrains.
It demonstrates several graph algorithms for
finding paths, such as depth-first search (DFS),
breadth-first search (BFS), Dijkstra's Algorithm,
A* search, and Alternate Path search.

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

Looking for a path from Cogen to Clock.
Executing depth-first search algorithm ...
Algorithm complete.
Path length: 25
Path cost: 4.04
Locations visited: 26

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 alternate path algorithm ...
Algorithm complete.
Path length: 6
Path cost: 0.616
Locations visited: 10