Anonymous user
Talk:Dijkstra's algorithm: Difference between revisions
Promotions? Not yet…
(Promotions? Not yet…) |
|||
Line 8:
:I'm floating a few more changes because it would be nice for this to come out of draft status looking all polished. I moved the documentation requirement to EC because I didn't want it to scare people from submitting initial solutions, and because I saw the tendency for documentation to get wordy. The directed/undirected point is important, and there's another point I'll give a new section below, single path/path tree. —[[User:Sonia|Sonia]] 21:25, 6 February 2012 (UTC)
Ugh! This draft task is a mess. The solutions are in three groups: those who think it is a directed graph and show their output, those who think it is an undirected graph and show their output (a larger number than the directed graph camp), and those who don't show any output of the search at all (the largest group of all, though not a majority). No way can we take this to a full task with this much disagreement. Output of the shortest path and its cost ''must'' be present (use {{tmpl|output?}} mercilessly), and we must resolve which type of graph we're dealing with; changing the task after someone has solved it ''and not using the {{tmpl|update}} task to let them know'' isn't playing fair. –[[User:Dkf|Donal Fellows]] ([[User talk:Dkf|talk]]) 16:23, 11 May 2014 (UTC)
== Java example cleanup ==
| |||