minCut: Compute min-cut for an undirected graph

In RBGL: An interface to the BOOST graph library

Description

Compute min-cut for an undirected graph

Usage

minCut(g)

Arguments

g	an instance of the graph class with edgemode “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 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.

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
V-S	the other subset of vertices in the minimum cut

Author(s)

Li Long <[e-mail]>

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, Lie-Quan Lee, and Andrew Lumsdaine; (Addison-Wesley, Pearson Education Inc., 2002), xxiv+321pp. ISBN 0-201-72914-8

See Also

edgeConnectivity

Examples

con <- file(system.file("XML/conn.gxl",package="RBGL"), open="r")
coex <- fromGXL(con)
close(con)

minCut(coex)

RBGL documentation built on Nov. 8, 2020, 5 p.m.