FindBiEdgeConnectedCutEdges: Find Bi-Edge-Connected Cut Edges

In rlemon: R Access to LEMON Graph Algorithms

Find Bi-Edge-Connected Cut Edges

Description

The bi-edge-connected components are the classes of an equivalence relation on the nodes of an undirected graph. Two nodes are in the same class if they are connected with at least two edge-disjoint paths. The bi-edge-connected components are separted by the cut edges of the components.

Usage

FindBiEdgeConnectedCutEdges(arcSources, arcTargets, numNodes)

Arguments

arcSources	Vector corresponding to the source nodes of a graph's edges
arcTargets	Vector corresponding to the destination nodes of a graph's edges
numNodes	The number of nodes in the graph

Details

See https://lemon.cs.elte.hu/pub/doc/1.3.1/a00616.html#ga58d444eba448c5f1a53539bd1b69636e for more information.

Value

A named list containing 1) "sources": a vector of cut edge sources, and 2) "destinations": a vector of cut edge destinations.

rlemon documentation built on Feb. 16, 2023, 5:33 p.m.