Revision as of 10:27, 28 May 2011 edit Kh naba (talk \| contribs) 23 edits m →Running Time ← Previous edit		Revision as of 10:53, 28 May 2011 edit undo X7q (talk \| contribs) Rollbackers 1,695 edits →Running Time Next edit →
Line 61: :::: Okay, I have fixed the article by (1) adding step 19 explaining the need of decrease-key operation and (2) explaining runtime with and without the extra indexing. I believe this is much more clear now. Thanks for you inputs. [[User:Kh naba\|Kh naba]] ([[User talk:Kh naba\|talk]]) 10:27, 28 May 2011 (UTC) ::::: I don't think we need to list that suboptimal time. No one implements Dijkstra in that way. It's even worse than array-based Dijsktra (O(V^2) <= O(VE) for connected graphs). A note explaining that a array of indexes into binary heap is required to achieve stated time bounds would be useful though -- [[User:X7q\|X7q]] ([[User talk:X7q\|talk]]) 10:53, 28 May 2011 (UTC)

Talk:Dijkstra's algorithm: Difference between revisions