minCut                 package:RBGL                 R Documentation

_C_o_m_p_u_t_e _m_i_n-_c_u_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:

     Compute min-cut for an undirected graph

_U_s_a_g_e:

     minCut(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:

     Given an undirected graph G=(V, E) of a single connected
     component, a cut is  a partition of the set of vertices into two
     non-empty subsets S and V-S, a  cost is the number of edges that
     are incident on one vertex in S and one  vertex in V-S.  The
     min-cut problem is to find a cut (S, V-S) of minimum cost.

     For simplicity, the returned subset S is the smaller of the two
     subsets.

_V_a_l_u_e:

     A list of  

  mincut: the number of edges to be severed to obtain the minimum cut

       S: the smaller subset of vertices in the minimum cut

     V-S: the other subset of vertices in the minimum cut

_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:

     'edgeConnectivity'

_E_x_a_m_p_l_e_s:

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

