Algorithm 1

$s=source\_node$ $d=destination\_node$ $Q=\left\{all\_nodes\right\}$ $Path\_List=\{\varnothing \}$ $path=\left\{s\right\}$ $path.distance=0$ $Search\_Path\left(s,d,Q,path,path.distance\right)$ {   if ($s==d$) $\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}Path\_List=Path\_List\cup \left\{path\right\}$   else      foreach adjacent node $v$ of $s$      { $\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}{Q}^{*}=Q-\left\{s\right\}$ $\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}pat{h}^{*}=path\cup \left\{v\right\}$ $\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}pat{h}^{*}.distance=path.distance+weight\left(s,v\right)$ $\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}Search\_Path\left(v,d,Q^{*},pat{h}^{*},pat{h}^{*}.distance\right)$      } }