# Ford Fulkerson Algorithm Assignment Help

The Ford Fulkerson algorithm works out the maximum flow in a flow network. Therefore, considering that there's a link between the starting node (the source) and also the end node (the sink), and then flow will be able to go through that path. If we arefound the path than, the method is repeated.

## Method of Ford-Fulkerson:

- Try to enhance the flow, until we reach the maximum value of the flow
- The residual capacity of the network with a flow f is given by:

The residual capacity (rc) of an edge (i,j) equals c(i,j) – f(i,j) when (i,j) is a forward edge, and equals f(i,j) when (i,j) is a backward edge. Whenever the residual capacity of an edge is always non-negative.