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 removing  any one of its vertex and all the edges incident on
     this vertex.  

     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 is an articulation point in the graph when removing it,
     the number of  connected components in the graph will increase.

     See documentation in Boost Graph Library for more details.

_V_a_l_u_e:

     For 'biConnComp': 

no. of biconnected components: number of biconnected components in the
          graph

biconnected components: component label for each edge in the graph

no. of articulation points: number of articulation points in the graph

articulation points: list 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 by Siek et al.

_S_e_e _A_l_s_o:

_E_x_a_m_p_l_e_s:

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

