contains

<code>contains</code> returns <code>TRUE</code> if the network contains the edge (i, j).

An efficient and incremental approach for calculating
the differences in orbit counts when performing single edge modifications
in a network. Calculating the differences in orbit counts is much more efficient than
recalculating all orbit counts from scratch for each time point.

Robrecht Cannoodt

incgraph

Incremental Graphlet Counting for Network Optimisation

contains function

<dl><dt>network</dt>
<dd>An instance of the incgraph.network class</dd>
<dt>i</dt>
<dd>A node in <code>network</code></dd>
<dt>j</dt>
<dd>A node in <code>network</code></dd></dl>

Arguments

Contains — contains

<dl>

<dt>network</dt>
<dd>An instance of the incgraph.network class</dd>


<dt>i</dt>
<dd>A node in <code>network</code></dd>


<dt>j</dt>
<dd>A node in <code>network</code></dd>

</dl>

contains: Contains

Description

Usage

Value

Arguments

See Also