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

Looking for a path from Minneapolis to Los Angeles.
Executing depth-first search algorithm ...
Algorithm complete.
Path length: 9
Path cost: 3300
Locations visited: 9

Looking for a path from Minneapolis to Los Angeles.
Executing breadth-first search algorithm ...
Algorithm complete.
Path length: 3
Path cost: 3100
Locations visited: 13

Looking for a path from Minneapolis to Los Angeles.
Executing Dijkstra's algorithm ...
Algorithm complete.
Path length: 4
Path cost: 1590
Locations visited: 19

Looking for a path from Minneapolis to Los Angeles.
Executing A* algorithm ...
Algorithm complete.
Path length: 4
Path cost: 1590
Locations visited: 4

Looking for a path from Minneapolis to Los Angeles.
Executing alternate path algorithm ...
Algorithm complete.
Path length: 5
Path cost: 1670
Locations visited: 6