Revision as of 17:09, 24 January 2014 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,633 edits →Djikstra and Prim algorithms: r ← Previous edit		Revision as of 23:50, 22 May 2015 edit undo Crisco 1492 (talk \| contribs) Autopatrolled, Administrators 139,854 edits info Next edit →
Line 211: It is not clear the meaning of the sentence saying that Dijkstra "rediscovered" the algorithm: it seems to suggest that Prim's algorithm and the famous Djikstra's shortest path algorithm are the same, while they solve two different problems (minimum spanning tree and single-source shortest path problem). The quote should be made more precise or eliminated <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/93.36.87.111\|93.36.87.111]] ([[User talk:93.36.87.111\|talk]]) 12:01, 24 January 2014 (UTC)</span><!-- Template:Unsigned IP --> <!--Autosigned by SineBot--> :No, it means precisely what it says: Dijkstra rediscovered the same minimum spanning tree algorithm. —[[User:David Eppstein\|David Eppstein]] ([[User talk:David Eppstein\|talk]]) 17:09, 24 January 2014 (UTC) == [[:File:MAZE 30x20 Prim.ogv]] to appear as POTD == Hello! This is a note to let the editors of this article know that [[:File:MAZE 30x20 Prim.ogv]] will be appearing as [[Wikipedia:picture of the day\|picture of the day]] on June 12, 2015. You can view and edit the POTD blurb at [[Template:POTD/2015-06-12]]. If this article needs any attention or maintenance, it would be preferable if that could be done before its appearance on the [[Main Page]]. Thanks! — [[User:Crisco 1492\|Chris Woodrich]] ([[User talk:Crisco 1492\|talk]]) 23:50, 22 May 2015 (UTC) {{POTD/2015-06-12}}

Talk:Prim's algorithm: Difference between revisions