edgeConnectivity
computed edge connectivity and min disconnecting set for an undirected graph
computed edge connectivity and min disconnecting set for an undirected graph
 Keywords
 models
Usage
edgeConnectivity(g)
Arguments
 g
 an instance of the
graph
class withedgemode
“undirected”
Details
Consider a graph G consisting of a single connected component. The edge connectivity of G is the minimum number of edges in G that can be cut to produce a graph with two (disconnected) components. The set of edges in this cut is called the minimum disconnecting set.
Value

A list:
 connectivity
 the integer describing the number of edges that must be severed to obtain two components
 minDisconSet
 a list (of length
connectivity
) of pairs of node names describing the edges that need to be cut to obtain two components
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)
edgeConnectivity(coex)
Community examples
Looks like there are no examples yet.