Timeline for Dijkstra's algorithm to compute shortest paths using k edges?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 17, 2016 at 8:10 | comment | added | D.W.♦ | @Raphael, yeah, it does seem a bit pointless to me too. | |
| Feb 17, 2016 at 7:25 | comment | added | Raphael | Since this is slower than Bellman-Ford (in theory, and probably also in practice because we have to construct a new, rather large graph first), I don't see much point -- but the OP asked for it. | |
| Feb 17, 2016 at 6:56 | vote | accept | Mathguy | ||
| Feb 17, 2016 at 6:26 | history | answered | D.W.♦ | CC BY-SA 3.0 |