Anonymous user
Talk:Dijkstra's algorithm: Difference between revisions
→Example size and heaps
(→Example size and heaps: new section) |
|||
Line 14:
Given how well the O(n^2) algorithm works, it should be fine for the basic task and I don't think we should fuss that it's inefficient. The heap enhancement makes a nice requirement for extra credit. To show it off seems to require a really big graph though! This thing with unixdict.txt is what I came up with for something that is repeatable. —[[User:Sonia|Sonia]] 00:30, 10 December 2011 (UTC)
: 21k nodes, but how many edges? --[[User:Ledrug|Ledrug]] 00:40, 10 December 2011 (UTC)
| |||