Combinatorica`
Combinatorica`

NetworkFlow

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »

NetworkFlow[g,source,sink]

returns the value of a maximum flow through graph g from source to sink.

NetworkFlow[g,source,sink,Edge]

returns the edges in g that have positive flow, along with their flows, in a maximum flow from source to sink.

NetworkFlow[g,source,sink,Cut]

returns a minimum cut between source and sink.

NetworkFlow[g,source,sink,All]

returns the adjacency list of g along with flows on each edge in a maximum flow from source to sink.

Details and Options

Examples

Basic Examples  (2)

NetworkFlow has been superseded by FindMaximumFlow:

Wolfram Research (2012), NetworkFlow, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/NetworkFlow.html.

Text

Wolfram Research (2012), NetworkFlow, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/NetworkFlow.html.

CMS

Wolfram Language. 2012. "NetworkFlow." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/NetworkFlow.html.

APA

Wolfram Language. (2012). NetworkFlow. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/NetworkFlow.html

BibTeX

@misc{reference.wolfram_2024_networkflow, author="Wolfram Research", title="{NetworkFlow}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/NetworkFlow.html}", note=[Accessed: 22-December-2024 ]}

BibLaTeX

@online{reference.wolfram_2024_networkflow, organization={Wolfram Research}, title={NetworkFlow}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/NetworkFlow.html}, note=[Accessed: 22-December-2024 ]}