PRE>

<P>
The <TT>strong_components()</TT> functions compute the strongly
connected components of a directed graph using Tarjan's algorithm
based on DFS&nbsp;[<A
HREF="bibliography.html#tarjan72:dfs_and_linear_algo">41</A>].
</p>

<P>
The output of the algorithm is recorded in the component property
map <TT>comp</TT>, which will contain numbers giving the component ID
assigned to each vertex. The number of components is the return value
of the function.
</p>

<H3>Where Defined</H3>

<P>
<a href="../../../bo