fundCycles                package:ggm                R Documentation

_F_u_n_d_a_m_e_n_t_a_l _c_y_c_l_e_s

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

     Finds the list of fundamental cycles of a connected undirected
     graph.

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

     fundCycles(amat)

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

    amat: a symmetric matrix with dimnames denoting the adjacency
          matrix of the undirected graph. The graph must be connected,
          otherwise the function returns an error message.

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

     All the cycles in an UG can be obtained from combination (ring
     sum) of the set of fundamental cycles.

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

     a list of matrices with two columns. Every component of the list
     is associated to a cycle. The cycle is described by a k times 2
     matrix whose rows are the edges of the cycle. If there is no cycle
     the function returns 'NULL'.

_N_o_t_e:

     This function is used by 'cycleMatrix' and 'isGident'.

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

     Giovanni M. Marchetti

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

     Thulasiraman, K. & Swamy, M.N.S. (1992). _Graphs: theory and
     algorithms_. New York: Wiley.

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

     'UG','findPath', 'cycleMatrix', 'isGident','bfs'

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

     ## Three fundamental cycles
     fundCycles(UG(~a*b*d + d*e + e*a*f))

