FindStronglyConnectedCutArcs: Find Strongly Connected Cut Arcs

In rlemon: R Access to LEMON Graph Algorithms

Find Strongly Connected Cut Arcs

Description

The strongly connected components are the classes of an equivalence relation on the nodes of a directed graph. Two nodes are in the same class if they are connected with directed paths in both direction. The strongly connected components are separated by the cut arcs.

Usage

FindStronglyConnectedCutArcs(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#gad7af5c3a97453e37f251f0e86dbb83db for more information.

Value

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

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