finds the maximum flow in a network
flow(G, s, t)
flow(G, s, t, 'maxflow'=n)
flow(G, s, t, eset, comp)
flow(G, s, t, eset, comp, 'maxflow'=n)
graph or network
source vertex for flow
sink vertex for flow
non-negative integer, upper bound for flow
name for the set of saturated edges
name for vertices in eset
Important: The networks package has been deprecated. Use the superseding command GraphTheory[MaxFlow] instead.
It returns the maximum flow from s to t in G.
If 'maxflow' option is set then flow of at most n in G is found.
This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[flow](...).
G ≔ petersen⁡:
eset ≔ 'eset':comp ≔ 'comp':
Download Help Document
What kind of issue would you like to report? (Optional)