minCut
Compute mincut for an undirected graph
Compute mincut for an undirected graph
 Keywords
 models
Usage
minCut(g)
Arguments
 g
 an instance of the
graph
class withedgemode
“undirected”
Details
Given an undirected graph G=(V, E) of a single connected component, a cut is a partition of the set of vertices into two nonempty subsets S and VS, a cost is the number of edges that are incident on one vertex in S and one vertex in VS. The mincut problem is to find a cut (S, VS) of minimum cost.
For simplicity, the returned subset S is the smaller of the two subsets.
Value

A list of
 mincut
 the number of edges to be severed to obtain the minimum cut
 S
 the smaller subset of vertices in the minimum cut
 VS
 the other subset of vertices in the minimum cut
References
Boost Graph Library ( www.boost.org/libs/graph/doc/index.html )
The Boost Graph Library: User Guide and Reference Manual; by Jeremy G. Siek, LieQuan Lee, and Andrew Lumsdaine; (AddisonWesley, Pearson Education Inc., 2002), xxiv+321pp. ISBN 0201729148
See Also
Examples
con < file(system.file("XML/conn.gxl",package="RBGL"), open="r")
coex < fromGXL(con)
close(con)
minCut(coex)
Community examples
Looks like there are no examples yet.