Revision as of 09:19, 27 October 2015 edit 212.250.200.210 (talk) No edit summary ← Previous edit		Revision as of 09:20, 27 October 2015 edit undo SineBot (talk \| contribs) Bots 2,564,671 edits m Signing comment by 212.250.200.210 - "" Next edit →
Line 185: :::I'd say that calls for some bookkeeping, but it's simple enough and I should have thought of it. Thanks, and sorry. —[[User:C. lorenz\|c. lorenz]] ([[User talk:C. lorenz\|talk]]) 14:48, 7 October 2008 (UTC) ::::Just a note to clarify the above explanation (wasn't obvious to me). You keep an array of distances from each remaining node to closest node in tree. When one node is added to the tree, you only need to check if the distances of remaining nodes to new node is smaller than previous closest. This makes it < \|V\| checks for every node added -> O(V). <small class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/212.250.200.210\|212.250.200.210]] ([[User talk:212.250.200.210\|talk]]) 09:19, 27 October 2015 (UTC)</small><!-- Template:Unsigned IP --> <!--Autosigned by SineBot--> == Isn't there anything wrong in the example ? ==

Talk:Prim's algorithm: Difference between revisions