CountStronglyConnectedComponents: Count the Number of Strongly Connected Components

In rlemon: R Access to LEMON Graph Algorithms

Count the Number of Strongly Connected Components

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.

Usage

CountStronglyConnectedComponents(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#gad30bc47dfffb78234eeee903cb3766f4 for more information.

Value

An integer defining the number of strongly connected components

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