gives the minimum cut of the graph g.


uses rules vw to specify the graph g.

Details and Options

  • A minimum k-cut of a graph g is a partition of vertices of g into k disjoint subsets with the smallest number of edges between them.
  • FindMinimumCut returns a list of the form {cmin,{c1,c2,}}, where cmin is the value of a minimum cut found, and {c1,c2,} is a partition of the vertices for which it is found.
  • For weighted graphs, FindMinimumCut gives a partition {c1,c2,} with the smallest sum of edge weights possible between the sets ci.
  • The following option can be given:
  • EdgeWeight Automaticedge weight for each edge


open allclose all

Basic Examples  (1)

Find the minimum cut:

Highlight the cut:

Scope  (7)

FindMinimumCut works with undirected graphs:

Directed graphs:

Weighted graphs:


Mixed graphs:

Use rules to specify the graph:

FindMinimumCut works with large graphs:

Options  (1)

EdgeWeight  (1)

By default, the edge weight of an edge is taken to be its EdgeWeight property if available, otherwise 1:

Use EdgeWeight->weights to set the edge weight:

Properties & Relations  (3)

Use FindGraphPartition to find a cut with approximately equal-sized parts:

The minimum cut:

EdgeConnectivity is the same as the value of a minimum cut:

Use FindEdgeCut to obtain edges between cut sets:

Highlight the edges and cut sets:

Wolfram Research (2012), FindMinimumCut, Wolfram Language function, (updated 2015).


Wolfram Research (2012), FindMinimumCut, Wolfram Language function, (updated 2015).


Wolfram Language. 2012. "FindMinimumCut." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015.


Wolfram Language. (2012). FindMinimumCut. Wolfram Language & System Documentation Center. Retrieved from


@misc{reference.wolfram_2024_findminimumcut, author="Wolfram Research", title="{FindMinimumCut}", year="2015", howpublished="\url{}", note=[Accessed: 25-April-2024 ]}


@online{reference.wolfram_2024_findminimumcut, organization={Wolfram Research}, title={FindMinimumCut}, year={2015}, url={}, note=[Accessed: 25-April-2024 ]}