\HeaderA{biConnComp}{Compute biconnected components for a graph}{biConnComp}
\aliasA{articulationPoints}{biConnComp}{articulationPoints}
\keyword{models}{biConnComp}
\begin{Description}\relax
Compute biconnected components for a graph
\end{Description}
\begin{Usage}
\begin{verbatim}
biConnComp(g)
articulationPoints(g)
\end{verbatim}
\end{Usage}
\begin{Arguments}
\begin{ldescription}
\item[\code{g}] an instance of the \code{graph} class
\end{ldescription}
\end{Arguments}
\begin{Details}\relax
A biconnected graph is a connected graph that remains connected when removing 
any one of its vertex and all the edges incident on this vertex.  

A biconnected component of a graph is a subgraph which is biconnected.  An 
integer label is assigned to each edge to indicate which biconnected component 
it's in.

A vertex is an articulation point in the graph when removing it, the number of 
connected components in the graph will increase.

See documentation in Boost Graph Library for more details.
\end{Details}
\begin{Value}
For \code{biConnComp}:
\begin{ldescription}
\item[\code{no. of biconnected components}] number of biconnected components in the graph
\item[\code{biconnected components}] component label for each edge in the graph
\item[\code{no. of articulation points}] number of articulation points in the graph
\item[\code{articulation points}] list of articulation points in the graph
\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
\end{SeeAlso}
\begin{Examples}
\begin{ExampleCode}
coex <- fromGXL(file(system.file("XML/conn.gxl",package="RBGL"), open="r"))
biConnComp(coex)
articulationPoints(coex)
\end{ExampleCode}
\end{Examples}

