minCut {RBGL} | R Documentation |
Compute min-cut for an undirected graph
minCut(g)
g |
an instance of the graph class with edgemode
“undirected” |
Given an undirected graph G=(V, E) of a single connected component, a cut is a partition of the set of vertices into two non-empty subsets S and V-S, a cost is the number of edges that are incident on one vertex in S and one vertex in V-S. The min-cut problem is to find a cut (S, V-S) of minimum cost.
A list of
mincut |
the number of edges that must be severed to obtain the mincut |
S |
one subset of vertex in the mincut |
V-S |
the other subset of vertex in the mincut |
Li Long <li.long@isb-sib.ch>
Boost Graph Library by Siek et al.
edgeConnectivity
, edmunds.karp.max.flow
, push.relabel.max.flow
coex <- fromGXL(file(system.file("XML/conn.gxl",package="RBGL"))) minCut(coex)