\HeaderA{minCut}{Compute min-cut for an undirected graph}{minCut}
\keyword{models}{minCut}
\begin{Description}\relax
Compute min-cut for an undirected graph
\end{Description}
\begin{Usage}
\begin{verbatim}
minCut(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
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.

For simplicity, the returned subset S is the smaller of the two subsets.
\end{Details}
\begin{Value}
A list of 
\begin{ldescription}
\item[\code{mincut}] the number of edges to be severed to obtain the minimum cut
\item[\code{S}] the smaller subset of vertices in the minimum cut
\item[\code{V-S}] the other subset of vertices in the minimum cut
\end{ldescription}
\end{Value}
\begin{Author}\relax
Li Long <li.long@isb-sib.ch>
\end{Author}
\begin{References}\relax
Boost Graph Library by Siek et al.
\end{References}
\begin{SeeAlso}\relax
\code{\LinkA{edgeConnectivity}{edgeConnectivity}}
\end{SeeAlso}
\begin{Examples}
\begin{ExampleCode}
coex <- fromGXL(file(system.file("XML/conn.gxl",package="RBGL"), open="r"))
minCut(coex)
\end{ExampleCode}
\end{Examples}

