Compute the shortest paths tree rooted at
(2) Modify the weights of each link to
   /* is the length of the shortest path in from to /
(3) For
(4)   , ,
(5)
(6)
(7) While
(8)  EXTRACT-MIN 
(9)  DELETE  /* becomes a forest of subtrees*/
(10)    For each non-tree link in such that or and are in different subtrees
(11)      If
(12)        , 
Algorithm 10: Suurballe-Tarjan-2-link-disjoint-paths .