get.neighbours

<code>get.neighbours</code> returns a vector of all neighbours of <code>i</code>.

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

get.neighbours 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></dl>

Arguments

Neighbours — get.neighbours

<dl>

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


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

</dl>

get.neighbours: Neighbours

Description

Usage

Value

Arguments

See Also