Road Ahead Closed! What To Do? An Application of Ford Fulkerson’s Network Flow Algorithm on Education City

Education City is referred to as the hub of education innovation, and community development across the state of Qatar. For that reason, every day at least one event is happening in one of its facilities. In most cases, the transportation authorities feel obliged to close some roads connecting the facilities in Education City to redirect the surplus flow of attendees to move smoothly across the city and to find Parking space. This paper details the solution to that specific problem by using the Ford Fulkerson’s Network Flow Algorithm to find the optimal path for the least congested flow of cars from a source S to a destination T. This paper will lay the problem definition by explaining the problem background, the problem definition and assumptions. The paper then will discuss the implementation details, showing the pseudo code, and some results