strongComp
Identify Strongly Connected Components
The strongly connected components in a directed graph are identified and returned as a list.
 Keywords
 models
Usage
strongComp(g)
Arguments
 g
 graph with
edgemode
“directed”.
Details
Tarjan's algorithm is used to determine all strongly connected components of a directed graph.
Value

A list whose length is the number of strongly connected components in
g
. Each element of the list is a vector of the node labels for
the nodes in that component.
References
Boost Graph Library ( www.boost.org/libs/graph/doc/index.html )
The Boost Graph Library: User Guide and Reference Manual; by Jeremy G. Siek, LieQuan Lee, and Andrew Lumsdaine; (AddisonWesley, Pearson Education Inc., 2002), xxiv+321pp. ISBN 0201729148
See Also
Examples
con < file(system.file("XML/kmstEx.gxl",package="RBGL"), open="r")
km < fromGXL(con)
close(con)
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))
Community examples
Looks like there are no examples yet.