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.

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

Looking for a path from 65427082 to 612016919.
Executing depth-first search algorithm ...
Algorithm complete.
Path length: 482
Path cost: 70.9783
Locations visited: 945

Looking for a path from 65427082 to 612016919.
Executing breadth-first search algorithm ...
Algorithm complete.
Path length: 29
Path cost: 6.24495
Locations visited: 1261

Looking for a path from 65427082 to 612016919.
Executing Dijkstra's algorithm ...
Algorithm complete.
Path length: 39
Path cost: 4.98128
Locations visited: 949

Looking for a path from 65427082 to 612016919.
Executing A* algorithm ...
Algorithm complete.
Path length: 39
Path cost: 4.98128
Locations visited: 231

Looking for a path from 65427082 to 612016919.
Executing alternate path algorithm ...
Algorithm complete.
Path length: 43
Path cost: 5.02612
Locations visited: 387