strongComp               package:RBGL               R Documentation

_I_d_e_n_t_i_f_y _S_t_r_o_n_g_l_y _C_o_n_n_e_c_t_e_d _C_o_m_p_o_n_e_n_t_s

_D_e_s_c_r_i_p_t_i_o_n:

     The strongly connected components in a directed graph are
     identified and returned as a list.

_U_s_a_g_e:

     strongComp(g)

_A_r_g_u_m_e_n_t_s:

       g: graph with 'edgemode' "directed".

_D_e_t_a_i_l_s:

     Tarjan's algorithm is used to determine all strongly connected
     components of a _directed graph_.

_V_a_l_u_e:

     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.

_A_u_t_h_o_r(_s):

     Vince Carey <stvjc@channing.harvard.edu>

_R_e_f_e_r_e_n_c_e_s:

     Boost Graph Library

_S_e_e _A_l_s_o:

     'connComp','connectedComp', 'same.component'

_E_x_a_m_p_l_e_s:

     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))

