get.adjedgelist: Adjacency lists

In igraph: Network Analysis and Visualization

Adjacency lists

Description

get.adjedgelist() was renamed to as_adj_edge_list() to create a more consistent API.

Usage

get.adjedgelist(
  graph,
  mode = c("all", "out", "in", "total"),
  loops = c("twice", "once", "ignore")
)

Arguments

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.
loops	Character scalar, one of "ignore" (to omit loops), "twice" (to include loop edges twice) and "once" (to include them once). "twice" is not allowed for directed graphs and will be replaced with "once".

igraph documentation built on Oct. 20, 2024, 1:06 a.m.