FindStronglyConnectedCutArcs

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.

Allows easy access to the LEMON Graph Library set of algorithms, written in C++.
See the LEMON project page at <https://lemon.cs.elte.hu/trac/lemon>.
Current LEMON version is 1.3.1.

Josh Errickson

rlemon

R Access to LEMON Graph Algorithms

Arav Agarwal

Aditya Tewari

FindStronglyConnectedCutArcs function

<dl><dt>arcSources</dt>
<dd>Vector corresponding to the source nodes of a graph's
edges</dd>
<dt>arcTargets</dt>
<dd>Vector corresponding to the destination nodes of a graph's
edges</dd>
<dt>numNodes</dt>
<dd>The number of nodes in the graph</dd></dl>

Arguments

Find Strongly Connected Cut Arcs — FindStronglyConnectedCutArcs

<dl>

<dt>arcSources</dt>
<dd>Vector corresponding to the source nodes of a graph's
edges</dd>


<dt>arcTargets</dt>
<dd>Vector corresponding to the destination nodes of a graph's
edges</dd>


<dt>numNodes</dt>
<dd>The number of nodes in the graph</dd>

</dl>

FindStronglyConnectedCutArcs: Find Strongly Connected Cut Arcs

Description

Usage

Value

Arguments

Details