Rosetta Code

Talk:Dijkstra's algorithm: Difference between revisions

Page Discussion

Talk:Dijkstra's algorithm (view source)

Revision as of 18:42, 21 December 2012

427 bytes removed ,  11 years ago
→‎Directed vs undirected graphs
Line 36:
 
:I just changed the task to specify a directed graph, and keeping the same example data, this changes the solution from acfe to acde, thus invalidating existing solutions. Sure the task could be written to keep acfe the correct solution, but I thought directedness was important enough to point out with a new solution. —[[User:Sonia|Sonia]] 21:25, 6 February 2012 (UTC)
 
::However, I think changing it to a directed graph and keeping the same data is a bad idea. The data when interpreted as a directed graph is a tree (it only has edges from a "lower" letter to a "higher" letter). Thus there is at most one possible path between any two possible nodes, thus would not really demonstrate the algorithm's ability to find the "shortest" path. --[[User:Spoon!|Spoon!]] 18:40, 21 December 2012 (UTC)
 
== Single path / Path Tree ==
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/210098"