avivbk / maximum_flow_in_a_flow_network Goto Github PK

The project receives as input a valid flow network represented by a directed graph with capacitances on the edges. The project finds maximum flow in the network through two approaches: 1. Ford Falkerson, Path Finding Improves Shortest Path Selection (BFS) 2. Ford Falkerson, finding an improving route with the greedy approach - by finding the heaviest route (Dijkstra variation with priority queue) Then finds the minimum capacity of the track At the end of the process, the user is shown the value of the maximum flow in the network as well as the minimum section in the network, by BFS on G(F)