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

Looking for a path from Hobbiton to Mount Doom.
Executing depth-first search algorithm ...
Algorithm complete.
Path length: 10
Path cost: 245
Locations visited: 12

Looking for a path from Hobbiton to Mount Doom.
Executing breadth-first search algorithm ...
Algorithm complete.
Path length: 7
Path cost: 186
Locations visited: 14

Looking for a path from Hobbiton to Mount Doom.
Executing Dijkstra's algorithm ...
Algorithm complete.
Path length: 9
Path cost: 175
Locations visited: 14

Looking for a path from Hobbiton to Mount Doom.
Executing A* algorithm ...
Algorithm complete.
Path length: 9
Path cost: 175
Locations visited: 14

Looking for a path from Hobbiton to Mount Doom.
Executing alternate path algorithm ...
Algorithm complete.
Path length: 9
Path cost: 185
Locations visited: 14