Repostting this question as I received some garbage answer the earlier time.

Python program: Need a working algorithm in python no pseudocode please.

Implement the Ford-Fulkerson maximum-flowalgorithm using python (Hint: see section 7.2.3 in http://www The restriction is that you have to always choose the shortest path in terms of number of edges, irrespective of the capacities or flows between the source (s) and target (t). To implement the program -if you are given a directed graph with integer (positive) capacities on the edges you have to find a s-t shortest path in terms of length, which is used to create the residual graph, and keep repeating until no path can be found. This w ndicate that maximum-flow has been achieved Consider a sample input file as follows: 0 1 3 0 2 3 0 3 4 1 4 2 2 1 10 2 4 1 3 55 4 3 1 4 5 1 47 2 575