Anonymous user
Talk:Dijkstra's algorithm: Difference between revisions
→Why is this a draft task?: …
(→Why is this a draft task?: because no one has removed the draft template yet?) |
|||
Line 4:
:It works the way it is. I would like better though if it prescribed some test data. The small example from WP would be okay. A large data set would be great, but my idea of linking words turned out kind of strange, and no other ideas have surfaced. I also think it would be nice if the task asked for solutions to note anything relevant about optimization. The priority queue in particular is a popular optimization of Dijkstra's original algorithm. —[[User:Sonia|Sonia]] 02:42, 25 January 2012 (UTC)
:: I admit I didn't grok what distance metric you were using, so I ignored that part of your code. :-) In general though, I concur that a common example is a good idea. –[[User:Dkf|Donal Fellows]] 13:50, 25 January 2012 (UTC)
== Java example cleanup ==
| |||