Algorithm 2

$Select\_DP\left(Path\_List\right)$   {     for $i=1$ to $Path\_List.Length-1$     { $\hspace{1em}\hspace{1em}\hspace{1em}Path1=Path\_List\left[i\right]$      for $j=i+1$ to $Path\_List.Length$      { $\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}Path2=Path\_List\left[j\right]$        if ($CommonNode\left(Path1,Path2\right)==0$)          return $Path1,Path2$      }     }   }