is.mutual: Find mutual edges in a directed graph

In igraph/rigraph: Network Analysis and Visualization

Find mutual edges in a directed graph

Description

is.mutual() was renamed to which_mutual() to create a more consistent API.

Usage

is.mutual(graph, eids = E(graph), loops = TRUE)

Arguments

graph	The input graph.
eids	Edge sequence, the edges that will be probed. By default is includes all edges in the order of their ids.
loops	Logical, whether to consider directed self-loops to be mutual.

igraph/rigraph documentation built on May 19, 2024, 6:19 a.m.