Max Flow Problem - Ford-Fulkerson Algorithm - Java | Algorithms
Given a directed graph which represents a flow network involving source(S) vertex and Sink (T) vertex. Each edge in the graph has an individual capacity which is the maximum flow that edge allows. Write an algorithm to find the maximum flow possible from source (S) vertex to sink (T) vertex.