edgeConnectivity {RBGL} | R Documentation |
computed edge connectivity and min disconnecting set for an undirected graph
edgeConnectivity(g)
g |
an instance of the graph class with edgemode
“undirected” |
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 connectivity ) of pairs of node names describing the edges
that need to be cut to obtain two components |
Vince Carey <stvjc@channing.harvard.edu>
Boost Graph Library by Siek et al.
minCut
, edmunds.karp.max.flow
, push.relabel.max.flow
coex <- fromGXL(file(system.file("XML/conn.gxl",package="RBGL"))) edgeConnectivity(coex)