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

Looking for a path from r018c127 to r052c097.
Executing depth-first search algorithm ...
Algorithm complete.
Path length: 385
Path cost: 384
Locations visited: 2663

Looking for a path from r018c127 to r052c097.
Executing breadth-first search algorithm ...
Algorithm complete.
Path length: 201
Path cost: 200
Locations visited: 2229

Looking for a path from r018c127 to r052c097.
Executing Dijkstra's algorithm ...
Algorithm complete.
Path length: 201
Path cost: 200
Locations visited: 2229

Looking for a path from r018c127 to r052c097.
Executing A* algorithm ...
Algorithm complete.
Path length: 201
Path cost: 200
Locations visited: 1690

# note (this does NOT appear in output) - this takes a long time to execute!
Looking for a path from r018c127 to r052c097.
Executing alternate path algorithm ...
Algorithm complete.
Path length: 361
Path cost: 360
Locations visited: 13132