Talk:Edge disjoint shortest pair algorithm

The algorithm described here is Suurballe's algorithm. An example is given here: http://www.acreo.com/upload/Publications/Events/GMPLS-PathComp.pdf from page 28. --Walker44 15:20, 28 June 2006 (UTC)

Shiortest pair?
What is the "shortest pair algorithm" entioned in the first step?--195.227.74.194 (talk) 14:40, 27 December 2007 (UTC)

Step 1, 2, 3 is just Djikstra?
Looks to me like the algorithm described in Steps 1-3 is just equivalent to Djikstra's algorithm and isn't related to the algorithm described in the bullet list? —Preceding unsigned comment added by 129.192.170.250 (talk) 00:34, 14 May 2010 (UTC)