5 ms·
Definitely worth looking at, the Bellman-Ford algorithm can traverse negative edges but is slower than Dijkstra's. An interesting read!
by jasebell 4y ago
Definitely worth looking at, the Bellman-Ford algorithm can traverse negative edges but is slower than Dijkstra's.
An interesting read!