Skip to contents

These functions are all-vertices version of neighbors() and incident().

Usage

as_adjlist(graph, mode = 3L, loops = 1L, multiple = 1L)

as_inclist(graph, mode = 3L, loops = 1L)

Arguments

graph

igraph_ptr object.

mode

Edge type to count; {1: OUT, 2: IN, 3: ALL}.

loops

How to treat loop edges; {0: NO_LOOPS, 1: LOOPS, 2: LOOPS_ONCE}

multiple

Boolean, whether to keep multiple (parallel) edges.

Details

as_adjlist(): Convert a graph to a list of adjacent vertices.

as_inclist(): Convert a graph to a list of incident edges.

See also

neighbors() and incident() for single-vertex version.