minCut {RBGL}R Documentation

Compute min-cut for an undirected graph

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.

Value

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

Author(s)

Li Long <li.long@isb-sib.ch>

References

Boost Graph Library by Siek et al.

See Also

edgeConnectivity, edmunds.karp.max.flow, push.relabel.max.flow

Examples

coex <- fromGXL(file(system.file("XML/conn.gxl",package="RBGL")))
minCut(coex)

[Package RBGL version 1.6.0 Index]