Talk:Dijkstra's algorithm: Difference between revisions
→Floyd–Warshall: new section
(Java example cleanup) |
(→Floyd–Warshall: new section) |
||
Line 2:
I've done some cleaning up of the Java example, making many of the problems in the code much less prominent. (For example, I've reduced the use of effectively-global variables and I've split the I/O from the algorithm.) More work is needed to finish transforming it from something that stank of old-skool [[C]], but it's a long way there. I've not really addressed any of the issues raised in the alertbox (e.g., the arbitrary node limit is still there — not that you'd want to have to type in the distance matrix for anything that large anyway) but they should now be much easier for someone else to address. –[[User:Dkf|Donal Fellows]] 03:22, 9 December 2011 (UTC)
== Floyd–Warshall ==
The "[[wp:Floyd–Warshall_algorithm|Floyd–Warshall algorithm]]" is also interesting, from a graph comparison point of view, since it finds all shortest paths in a graph in O(|V|^3) time, where the most highly optimized version of Dijkstra's algorithm requires O(|E| + |V| log |V|) for a path and there are O(|V|^2) potential paths. --[[User:Rdm|Rdm]] 20:47, 9 December 2011 (UTC)
| |||