Talk:Edge disjoint shortest pair algorithm: Difference between revisions

Content deleted Content added
TinucherianBot (talk | contribs)
Autoassessment for WP:COMP : ( FAQ ) : (Plugin++) class=Stub, auto=yes.
No edit summary
Line 5:
 
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?