he actual kernel values, updates at
each recursion</p></dd>


<dt>neighbour_list</dt>
<dd><p>a List, giving for each node an IntegerVector with
its neighbours</p></dd>


<dt>edge_mat</dt>
<dd><p>matrix, to find the id of each edge given two neighbours.</p></dd>


<dt>v</dt>
<dd><p>the actual node to consider for the recursion (int)</p></dd>


<dt>bw</dt>
<dd><p>the kernel bandwidth</p></dd>


<dt>line_weights</dt>
<dd><p>a vector with the length of the edges</p></dd>


<dt>samples_edgeid</dt>
<dd><p>a vecto