Content deleted Content added
→Shiortest pair?: new section |
m Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "Stub" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{WikiProject Computing}}. |
||
| (5 intermediate revisions by 3 users not shown) | |||
Line 1:
{{WikiProject banner shell|class=Stub|1=
{{WikiProject Computing|importance=|network=yes|auto=yes}}
}}
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. --[[User:Walker44|Walker44]] 15:20, 28 June 2006 (UTC)
Line 4 ⟶ 7:
What is the "shortest pair algorithm" entioned in the first step?--[[Special:Contributions/195.227.74.194|195.227.74.194]] ([[User talk: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? <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/129.192.170.250|129.192.170.250]] ([[User talk:129.192.170.250|talk]]) 00:34, 14 May 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
| |||