Macaulay2 » Documentation
Packages » Graphs :: edgeCuts
next | previous | forward | backward | up | index | toc

edgeCuts -- returns the edge cuts of a graph

Synopsis

Description

An edge cut is a minimal set of edges that, when removed from a graph, make the graph not connected. If the graph is already not connected, the method returns the empty set.

i1 : G = graph({{1,2},{2,3},{3,1},{3,4},{4,5},{5,3}},EntryMode=>"edges");
 
i2 : edgeCuts G

o2 = {{{1, 2}, {1, 3}}, {{1, 2}, {2, 3}}, {{1, 3}, {2, 3}}, {{4, 3}, {5, 3}},
     ------------------------------------------------------------------------
     {{4, 3}, {4, 5}}, {{5, 3}, {4, 5}}}

o2 : List

See also

Ways to use edgeCuts :

For the programmer

The object edgeCuts is a method function.