Talk:Floyd-Warshall algorithm: Difference between revisions
m
no edit summary
No edit summary |
mNo edit summary |
||
Line 5:
:: Go for it. (Thanks) --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 01:51, 13 April 2016 (UTC)
::: Er... now, the task says "Print the pair, the distance and the path." But the wikipedia [[wp:Floyd–Warshall_algorithm|Floyd–Warshall algorithm]] page says "A single execution of the algorithm will find the lengths (summed weights) of the shortest paths between all pairs of vertices, though it does not return details of the paths themselves."
::: Wikipedia does include a Floyd Warshall Path Reconstruction algorithm in with its description of the Floyd Warshall algorithm itself, but I think that these are two different algorithms and the more involved algorithm should be a separate task. Do you feel up to creating that separate task page? --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 21:41, 13 April 2016 (UTC)
| |||