Algorithms and Datastructures
Airline Routing System
Adam Lass
Mini Projekt 4 X Con Amore ❤️
Basis
Airport
Airport
FlightRoute
Shortest Path
MST
Search
Dijkstra's
Breadth-first
Depth-first
Prim's
A*
❤️
Search
Find if an airport can be reached from another using only a single
airline company
Depth-first
Stack
Search
Using alg: DFS
Found path!
Airline Code: HY
Path Length: 44
Time Taken: 176.72318 hr - Distance: 119324.31 km
-------PATH--------
AER -> TAS -> AZN -> DME -> BHK -> LED -> AZN -> TAS
-> BHK -> DME -> AZN -> LED -> BHK -> TAS -> CDG
-> UGC -> DME -> FEG -> KZN -> SKD -> DME -> KSQ
-> LED -> FEG -> DME -> NCU -> TAS -> DME -> NMA
-> LED -> KSQ -> DME -> NVI -> LED -> NMA -> DME
-> SKD -> KZN -> FEG -> LED -> NVI -> DME -> TAS
-> KUL -> SINBreadth-first
Queue
Search
Using alg: BFS
Found path!
Airline Code: HY
Path Length: 2
Time Taken: 11.644304 hr - Distance: 8042.12 km
-------PATH--------
AER -> TAS -> SINMinimum Spanning Tree
Find the airline that has the widest coverage
Prim's
Minimum Spanning Tree
Airline with biggest MST is SU with 148 covered
Airports and a total distance of 380329.2 km!Priority Queue
!
Shortest Path
Find the shortest path from one location to another (Distance & Time)
Dijkstra's
Priority Queue
Shortest Path
!
A*
❤️
----------------Shortest Path Distance----------------
Operations: 105991
Shortest path from AER to SIN is 7940.738 km
-------PATH--------
AER -> EVN -> IKA -> KUL -> SIN
----------------Shortest Path Time----------------
Operations: 60182
Shortest path from AER to SIN is 12.644304 hrs
-------PATH--------
AER -> TAS -> SINOperations: 2919
Shortest path from AER to SIN is 7940.738 km
-------PATH--------
AER -> EVN -> IKA -> KUL -> SINCopy of deck
By Adam Lass
