\HeaderA{strongComp}{Identify Strongly Connected Components}{strongComp}
\keyword{models}{strongComp}
\begin{Description}\relax
The strongly connected components in
a directed graph are identified and returned as a list.
\end{Description}
\begin{Usage}
\begin{verbatim}
strongComp(g)
\end{verbatim}
\end{Usage}
\begin{Arguments}
\begin{ldescription}
\item[\code{g}] graph with \code{edgemode} \dQuote{directed}.
\end{ldescription}
\end{Arguments}
\begin{Details}\relax
Tarjan's algorithm is used to determine all strongly connected
components of a \emph{directed graph}.
\end{Details}
\begin{Value}
A list whose length is the number of strongly connected components in
\code{g}. Each element of the list is a vector of the node labels for
the nodes in that component.
\end{Value}
\begin{Author}\relax
Vince Carey <stvjc@channing.harvard.edu>
\end{Author}
\begin{References}\relax
Boost Graph Library
\end{References}
\begin{SeeAlso}\relax
\code{\LinkA{connComp}{connComp}},\code{\LinkA{connectedComp}{connectedComp}}, \code{\LinkA{same.component}{same.component}}
\end{SeeAlso}
\begin{Examples}
\begin{ExampleCode}
km <- fromGXL(file(system.file("XML/kmstEx.gxl",package="RBGL"), open="r"))
km<- graph::addNode(c("F","G","H"), km)
km<- addEdge("G", "H", km, 1)
km<- addEdge("H", "G", km, 1)
strongComp(km)
connectedComp(ugraph(km))
\end{ExampleCode}
\end{Examples}

