Talk:Edge disjoint shortest pair algorithm

From Wikipedia, the free encyclopedia

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)

[edit] Shiortest pair?

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