Create an input file with a list of airports and their distances from one another.
Use a search algorithm to find the shortest path.
This was implemented using a Graph class and a recursive Depth First Search and Breadth First Search.
An implementation of a pathfinding algorithm using A* search, Graphs, and Nodes to find the shortest path from a starting airport to an ending airport.
Create an input file with a list of airports and their distances from one another.
Use a search algorithm to find the shortest path.
This was implemented using a Graph class and a recursive Depth First Search and Breadth First Search.
An implementation of a pathfinding algorithm using A* search, Graphs, and Nodes to find the shortest path from a starting airport to an ending airport.