biConnComp               package:RBGL               R Documentation

_C_o_m_p_u_t_e _b_i_c_o_n_n_e_c_t_e_d _c_o_m_p_o_n_e_n_t_s _f_o_r _a _g_r_a_p_h

_D_e_s_c_r_i_p_t_i_o_n:

     Compute biconnected components for a graph

_U_s_a_g_e:

     biConnComp(g)
     articulationPoints(g)

_A_r_g_u_m_e_n_t_s:

       g: an instance of the 'graph' class

_D_e_t_a_i_l_s:

     A biconnected graph is a connected graph that remains connected
     when  any one of its vertices, and all the edges incident on this
     vertex, is removed and the graph remains connected. 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 in a graph is called an articulation point if removing it
     increases  the number of connected components.

     See the documentation for the Boost Graph Library for more
     details.

_V_a_l_u_e:

     For 'biConnComp': a vector whose length is no. of biconnected
     components, each entry is a list  of nodes that are on the same
     biconnected components.

     For 'articulationPoints': a vector of articulation points in the
     graph.

_A_u_t_h_o_r(_s):

     Li Long <li.long@isb-sib.ch>

_R_e_f_e_r_e_n_c_e_s:

     Boost Graph Library ( www.boost.org/libs/graph/doc/index.html )

     The Boost Graph Library: User Guide and Reference Manual; by
     Jeremy G. Siek, Lie-Quan Lee, and Andrew Lumsdaine;
     (Addison-Wesley, Pearson Education Inc., 2002), xxiv+321pp. ISBN
     0-201-72914-8

_S_e_e _A_l_s_o:

_E_x_a_m_p_l_e_s:

     con <- file(system.file("XML/conn.gxl",package="RBGL"), open="r")
     coex <- fromGXL(con)
     close(con)

     biConnComp(coex)
     articulationPoints(coex)

