Create adjacency lists from a graph, either for adjacent edges or for neighboring vertices
as_adj_list(graph, mode = c("all", "out", "in", "total"))as_adj_edge_list(graph, mode = c("all", "out", "in", "total"))
A list of igraph.vs or a list of numeric vectors depending on
the value of igraph_opt("return.vs.es"), see details for performance
characteristics.
The input graph.
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.
Gabor Csardi csardi.gabor@gmail.com
as_adj_list returns a list of numeric vectors, which include the ids
of neighbor vertices (according to the mode argument) of all
vertices.
as_adj_edge_list returns a list of numeric vectors, which include the
ids of adjacent edgs (according to the mode argument) of all
vertices.
If igraph_opt("return.vs.es") is true (default), the numeric
vectors of the adjacency lists are coerced to igraph.vs, this can be
a very expensive operation on large graphs.
as_edgelist, as_adj
g <- make_ring(10)
as_adj_list(g)
as_adj_edge_list(g)
Run the code above in your browser using DataLab