Route and Flight Optimization
Graph algorithms to find profitable cyclic routes and lowest-cost flight connections.
Data & algorithms
All projectsProblem
Travel agencies and airlines need to know which routes and connections pay off among many possible combinations of cities and airports.
Solution
Two C programs that model the problem as a graph: one searches for cyclic bus routes that visit each city once with a minimum profit ratio; the other computes destinations, connections and lowest flight costs from text files.
Key features
- Graph stored as an adjacency matrix
- Cyclic route search with a minimum revenue-to-cost ratio
- Directed flight graph with connections and lowest costs
- Test cases read from text files
- Build and run with Make
Stack
- C
- Make
Platforms
- CLI