MinCut
GraphUtilities`
GraphUtilities`
MinCut
As of Version 10, all the functionality of the GraphUtilities package is built into the Wolfram System. »
MinCut[g,k]
partitions the undirected graph g into k parts where the number of edge cuts is approximately minimized.
更多信息和选项
- MinCut functionality is now available in the built-in Wolfram Language function FindGraphPartition.
- To use MinCut, you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
- MinCut treats the input as an undirected graph, and tries to find a partition of the vertices into k parts so that each part has roughly the same number of vertices, and so that the number of edges between these parts (known as the edge separator) is minimized.
范例
基本范例 (2)
This partitions the vertices into two parts with the minimum number of edge cuts:
MinCut has been superseded by FindGraphPartition:
Wolfram Research (2007)，MinCut，Wolfram 语言函数，https://reference.wolfram.com/language/GraphUtilities/ref/MinCut.html.
文本
Wolfram Research (2007)，MinCut，Wolfram 语言函数，https://reference.wolfram.com/language/GraphUtilities/ref/MinCut.html.
CMS
Wolfram 语言. 2007. "MinCut." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/GraphUtilities/ref/MinCut.html.
APA
Wolfram 语言. (2007). MinCut. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/GraphUtilities/ref/MinCut.html 年