Algorithm 3 get_node

Input:  $row$, $temp\_adj\_mat$ Output:  $related\_rows$    1:if  $row.s\_id\in nodes\_ids$  then    2: Find the nearest node in $nodes[row.s\_id]$ with t < $sim\_max\_delay$    3:    if $nearest\_node$ exists then    4:        return $nearest\_node$    5:    end if    6:else    7:   $row.id\leftarrow size(nodes\_ids)$    8:   Append $row$ to $nodes[row.s\_id]$ and $nodes\_ids$    9: Add 1 empty row and 1 empty column to $adj\_mat$ and $temp\_adj\_mat$  10:  return $row$  11:end if