computed edge connectivity and min disconnecting set for an undirected graph
computed edge connectivity and min disconnecting set for an undirected graph
edgeConnectivity(g)
g |
an instance of the |
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.
A list:
connectivity |
the integer describing the number of edges that must be severed to obtain two components |
minDisconSet |
a list (of length |
Vince Carey <stvjc@channing.harvard.edu>
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
con <- file(system.file("XML/conn.gxl",package="RBGL"), open="r")
coex <- fromGXL(con)
close(con)
edgeConnectivity(coex)Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.