Edmonds-Karp (EK) Algorithm

void EK(Graph G, Node s, Node t)
{
    change G into residual graph Gf;
    maxflow = 0;
    while (can find an augmented SHORTEST path P in Gf)
    {
        bottleneck b = minimum of edge weights in P;
        augment flow along P in Gf using b;

        maxflow += bottleneck;
    }

    print maxflow;
}