FindBiEdgeConnectedComponents

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.

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

FindBiEdgeConnectedComponents 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 Bi-Edge-Connected Components — FindBiEdgeConnectedComponents

<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>

FindBiEdgeConnectedComponents: Find Bi-Edge-Connected Components

Description

Usage

Value

Arguments

Details