Ford-Fulkerson Maximum Flow

Language of choice: C++

Takes an input file of flights.txt, in which each line of information is formatted

• Token 1 : Departure airport

• Token 2 : Arrival airport

• Token 3 : Departure time

• Token 4 : Arrival time

• Token 5 : Passenger capacity

Employs the Ford-Fulkerson method of calculating maximum flow

• While a path from the source node to the sink node exists

  • Find the minimum remaining edge weight

  • Add this value to the current edge weight for all edges the path contains

Data structures used to achieve this were

• Singly linked lists

• C++ Vectors