edge.disjoint.paths: Edge connectivity

In igraph/rigraph: Network Analysis and Visualization

Edge connectivity

Description

edge.disjoint.paths() was renamed to edge_connectivity() to create a more consistent API.

Usage

edge.disjoint.paths(graph, source = NULL, target = NULL, checks = TRUE)

Arguments

graph	The input graph.
source	The id of the source vertex, for edge_connectivity() it can be NULL, see details below.
target	The id of the target vertex, for edge_connectivity() it can be NULL, see details below.
checks	Logical constant. Whether to check that the graph is connected and also the degree of the vertices. If the graph is not (strongly) connected then the connectivity is obviously zero. Otherwise if the minimum degree is one then the edge connectivity is also one. It is a good idea to perform these checks, as they can be done quickly compared to the connectivity calculation itself. They were suggested by Peter McMahan, thanks Peter.

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