Talk:Edge disjoint shortest pair algorithm

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

This article is rated Stub-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:

Computing: Networking

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
???	This article has not yet received a rating on the project's importance scale.
	This article is supported by Networking task force.
	This article has been automatically rated by a bot or other tool as Stub-class because it uses a stub template. Please ensure the assessment is correct before removing the `\|auto=` parameter.

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)[reply]

Shiortest pair?

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

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)[reply]