allEdges                 package:ggm                 R Documentation

_A_l_l _e_d_g_e_s _o_f _a _g_r_a_p_h

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

     Finds the set of edges of a graph. That is the set of undirected
     edges if the graph is undirected and the set of arrows if the
     graph is directed.

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

     allEdges(amat)

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

    amat: a square Boolean matrix, with dimnames, the adjacency matrix
          of a graph.

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

     a matrix with two columns. Each row of the matrix is a pair of
     indices indicating an edge of the graph. If the graph is
     undirected, then only one of the pairs (i,j), (j,i) is reported.

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

     Giovanni M. Marchetti

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

     'cycleMatrix'

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

     ## A UG graph
     allEdges(UG(~ y*v*k +v*k*d+y*d))

     ## A DAG
     allEdges(DAG(u~h+o+p, h~o, o~p))

