Ford-Fulkerson (FF) Algorithm

void FF(Graph G, Node s, Node t)
{
    initialize flows on all edges in G to 0;
    change G into residual graph Gf;

    while (can find an augmented path P in Gf)
    {
        bottleneck b = minimum of edge weights in P;

        augment flow along P in G using b;

        regenerate Gf from updated G;
    }
    report maxflow f in G;
}