Important: The networks package has been deprecated.  Use the superseding package GraphTheory instead.

This routine returns the maximum flow from s to t in G.  It is normally called by the routine flow() which performs some setup and preliminary analysis based on edge-connectivity calculations.

Edge weights of G are interpreted as capacities.

If a non-negative integer upper bound n is specified for the flow then the routine terminates after a flow of n in G is found even if greater flows are possible.

This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[dinic](...).