\HeaderA{edgeConnectivity}{computed edge connectivity and min disconnecting set
for an undirected graph}{edgeConnectivity}
\keyword{models}{edgeConnectivity}
\begin{Description}\relax
computed edge connectivity and min disconnecting set
for an undirected graph
\end{Description}
\begin{Usage}
\begin{verbatim}
edgeConnectivity(g)
\end{verbatim}
\end{Usage}
\begin{Arguments}
\begin{ldescription}
\item[\code{g}] an instance of the \code{graph} class with \code{edgemode}
\dQuote{undirected}
\end{ldescription}
\end{Arguments}
\begin{Details}\relax
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.
\end{Details}
\begin{Value}
A list:
\begin{ldescription}
\item[\code{connectivity}] the integer describing the number of edges that must
be severed to obtain two components
\item[\code{minDisconSet}] a list (of length \code{connectivity}) of pairs of node names describing the edges
that need to be cut to obtain two components
\end{ldescription}
\end{Value}
\begin{Author}\relax
Vince Carey <stvjc@channing.harvard.edu>
\end{Author}
\begin{References}\relax
Boost Graph Library by Siek et al.
\end{References}
\begin{SeeAlso}\relax
\code{\LinkA{minCut}{minCut}}, \code{\LinkA{edmunds.karp.max.flow}{edmunds.karp.max.flow}}, \code{\LinkA{push.relabel.max.flow}{push.relabel.max.flow}}
\end{SeeAlso}
\begin{Examples}
\begin{ExampleCode}
coex <- fromGXL(file(system.file("XML/conn.gxl",package="RBGL"), open="r"))
edgeConnectivity(coex)
\end{ExampleCode}
\end{Examples}

