procedure Routing Algorithm For UDB (cur, dst)   cur: the current node, dst: the destination node
if     then
   using FP sent to the particular left neighbor
else  if     then
   randomly using FP or BP
else
   using BP sent to the particular right neighbor
end  if
  end  procedure
Algorithm 2: Undirected de Bruijn graph routing algorithm.