edgeConnectivity            package:RBGL            R Documentation

_c_o_m_p_u_t_e_d _e_d_g_e _c_o_n_n_e_c_t_i_v_i_t_y _a_n_d _m_i_n _d_i_s_c_o_n_n_e_c_t_i_n_g _s_e_t
_f_o_r _a_n _u_n_d_i_r_e_c_t_e_d _g_r_a_p_h

_D_e_s_c_r_i_p_t_i_o_n:

     computed edge connectivity and min disconnecting set for an
     undirected graph

_U_s_a_g_e:

     edgeConnectivity(g)

_A_r_g_u_m_e_n_t_s:

       g: an instance of the 'graph' class with 'edgemode' "undirected"

_D_e_t_a_i_l_s:

     Consider a graph G consisting of a single connected component. The
     edge connectivity of G is the minimum number of edges in G that
     can be cut to produce a graph with two (disconnected) components. 
     The set of edges in this cut is called the minimum disconnecting
     set.

_V_a_l_u_e:

     A list: 

connectivity: the integer describing the number of edges that must be
          severed to obtain two components

minDisconSet: a list (of length 'connectivity') of pairs of node names
          describing the edges that need to be cut to obtain two
          components

_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 by Siek et al.

_S_e_e _A_l_s_o:

     'minCut', 'edmunds.karp.max.flow', 'push.relabel.max.flow'

_E_x_a_m_p_l_e_s:

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

