Back to projects
Flight Route Finder
Flight route planning with Dijkstra algorithm and LRU cache optimization.
C++AlgorithmsData StructuresGraphs
Details
About the project
Inspired by flight search platforms like Skyscanner. Modeled airports as nodes and flights as directed edges. Supports parallel edges (different airlines) between the same airport pair.
Computes optimal route balancing cost and time with a tunable weight parameter (alpha). Built custom cache with quadratic probing and LRU eviction.
Highlights
Key features
- Directed multigraph supporting parallel edges
- Dijkstra's algorithm on multigraph
- Dynamic flight halt/resume mechanism
- Custom cache with quadratic probing and LRU
Tech Stack
Tools used
C++DijkstraHash TablePriority Queue