FindEdgeCut

FindEdgeCut[g]

finds a smallest edge cut of the graph g.

FindEdgeCut[g,s,t]

finds a smallest s-t edge cut of the graph g.

FindEdgeCut[{vw,…},…]

uses rules vw to specify the graph g.

Details and Options

  • An edge cut of a graph g is a set of edges whose deletion from g disconnects g.
  • The s-t edge cut is a list of edges who deletion from g disconnects g with s and t in two different connected components.
  • For weighted graphs, FindEdgeCut gives an edge cut with the smallest sum of edge weights.
  • For a disconnected graph, FindEdgeCut will return an empty list {}.
  • The following option can be given:
  • EdgeWeightAutomaticedge weight for each edge

Examples

open allclose all

Basic Examples  (2)

Find a smallest edge cut:

In[3]:=
Click for copyable input
In[4]:=
Click for copyable input
Out[4]=

Highlight an edge cut:

In[5]:=
Click for copyable input
Out[5]=

Find a smallest edge cut between two vertices:

In[1]:=
Click for copyable input
Out[1]=

Scope  (8)

Options  (1)

Applications  (1)

Properties & Relations  (4)

See Also

FindMinimumCut  EdgeConnectivity

Introduced in 2012
(9.0)
| Updated in 2015
(10.3)