FindBiNodeConnectedCutNodes

The bi-node-connected components are the classes of an equivalence relation
on the edges of a undirected graph. Two edges are in the same class if they
are on same circle.

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

FindBiNodeConnectedCutNodes 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-Node-Connected Cut Nodes — FindBiNodeConnectedCutNodes

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

FindBiNodeConnectedCutNodes: Find Bi-Node-Connected Cut Nodes

Description

Usage

Value

Arguments

Details