get.adjlist              package:igraph              R Documentation

_A_d_j_a_c_e_n_c_y _l_i_s_t_s

_D_e_s_c_r_i_p_t_i_o_n:

     Create adjacency lists from a graph, either for adjacent edges or
     for neighboring vertices

_U_s_a_g_e:

     get.adjlist(graph, mode = c("all", "out", "in", "total"))
     get.adjedgelist(graph, mode = c("all", "out", "in", "total"))

_A_r_g_u_m_e_n_t_s:

   graph: The input graph.

    mode: Character scalar, it gives what kind of adjacent
          edges/vertices to include in the lists. ''out'' is for
          outgoing edges/vertices, ''in'' is for incoming
          edges/vertices, ''all'' is for both. This argument is ignored
          for undirected graphs.

_D_e_t_a_i_l_s:

     'get.adjlist' returns a list of numeric vectors, which include the
     ids of neighbor vertices (according to the 'mode' argument) of all
     vertices.

     'get.adjedgelist' returns a list of numeric vectors, which include
     the ids of adjacent edgs (according to the 'mode' argument) of all
     vertices.

_V_a_l_u_e:

     A list of numeric vectors.

_A_u_t_h_o_r(_s):

     Gabor Csardi csardi@rmki.kfki.hu

_S_e_e _A_l_s_o:

     'get.edgelist', 'get.adjacency'

_E_x_a_m_p_l_e_s:

     g <- graph.ring(10)
     get.adjlist(g)
     get.adjedgelist(g)

