NetworkFlow
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.
更多信息和选项
- NetworkFlow functionality is now available in the built-in Wolfram Language function FindMaximumFlow.
- To use NetworkFlow, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
- The graph g can be a directed or an undirected graph.
范例
基本范例 (2)
NetworkFlow has been superseded by FindMaximumFlow:
文本
Wolfram Research (2012)，NetworkFlow，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/NetworkFlow.html.
CMS
Wolfram 语言. 2012. "NetworkFlow." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/NetworkFlow.html.
APA
Wolfram 语言. (2012). NetworkFlow. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/NetworkFlow.html 年