Dinic's algorithm to find the maximum flow from s to t where s != t. Generalizes the Hopcroft-Karp maximum bipartite matching algorithm. V^2E in general, min(V^(2/3),sqrt(E))E when all edges are unit capacity, sqrt(V)E when all vertices are unit capacity as in bipartite graphs. # Panics Panics if the maximum flow is 2^63 or larger.
(&self, s: usize, t: usize)
source not stored for this graph (policy: none)