Algorithm 7  Recursive FHE parameterisation source and cost discovery over multi- directed graphs.

functionautoHE_discover(g, n, s, $\mathit{concern}$, c)

$d\leftarrow g.\mathrm{nodes}\left(\right).\mathrm{get}\left(n\right)$

if $d.\mathrm{get}(″\mathrm{sources}″)=\mathit{None}$ then

$d\left[″\mathrm{sources}″\right]\leftarrow \mathrm{dict}\left(\right)$

if $s\ne n$ then

if $d\left[″\mathrm{sources}″\right].\mathrm{get}\left(s\right)=\mathit{None}$ then

$d\left[″\mathrm{sources}″\right]\left[s\right]\leftarrow c$

else if $d\left[″\mathrm{sources}″\right].\mathrm{get}\left(s\right)<\mathit{c}$ then

$d\left[″\mathrm{sources}″\right]\left[s\right]\leftarrow c$

if $\mathrm{isinstance}\left(d\right[″\mathrm{node}″],\mathit{concern})$ then

$\mathrm{autoHE\_discover}(g,n,n,\mathit{concern},0)$

else

for $i\mathrm{in}g.\mathrm{successors}\left(n\right)$ do

$\mathit{nxt}\leftarrow c+g.\mathrm{nodes}\left(\right)\left[i\right]\left[″\mathrm{node}″\right].\cos \mathrm{t}\left(\right)$

$\mathrm{autoHE\_discover}(g,i,s,\mathit{concern},\mathit{nxt})$