Add max flow retrieval using Ford-Fulkerson

Ford-Fulkerson algorithm for maximum flow over weighted directed
graph retrieval provides O(E^2*U) complexity.