Revision as of 04:51, 8 April 2011 edit MiszaBot I (talk \| contribs) 234,552 edits m Archiving 2 thread(s) (older than 365d) to Talk:Dijkstra's algorithm/Archive 1. ← Previous edit		Revision as of 17:29, 18 April 2011 edit undo Subh83 (talk \| contribs) Extended confirmed users 1,488 edits →Python code: new section Next edit →
Line 37: Look at the anim. First it goes to node #2. then when it wants to go to node #3 it count the length 9. it's absolutely wrong because if you want to go from #2 to #3 you must pass from a edge length 10. So what's the meaning of this? can anyone explain it for me? <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/109.162.218.57\|109.162.218.57]] ([[User talk:109.162.218.57\|talk]]) 12:31, 7 April 2011 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--> == Python code == According to [[WP:NOTREPOSITORY]], the python code should not be here. I suggest that it be deleted soon. Please discuss it here. - [[User:Subh83\| '''Subh83''']] <small>([[User_talk:Subh83\|talk]] \| [[User:Subh83/contribs\|contribs]])</small> 17:29, 18 April 2011 (UTC)

Talk:Dijkstra's algorithm: Difference between revisions