Jason Ang, Patrick Wu, William Dinicola
- Finding the most optimal path with regard to airport/population size of air flight traveling from airport to airport.
- This implementation can be used to save the airplane industry billions of dollars of resources and labor cost. It will create an optimized system for routes based on population and flight availability.
- Create a gui application to house the visualization
- Uses around 8k rows of data of airports
- Create random flights (edges) with dataset
- Finds the best path from one destination to another that the user inputs in the randomized (Graph)
- Shows the shortest path by airports locations and distance (km)
- Shows and compares the displacemnt distance (km)
- Shows and compares the time computation in microseconds of the Dijsktra and A* alorithm
- Produce a viuslization of the path using sfml
- Dijkstra's algorithm
- A* algorithm