| Menu × × Correct! Exercise:What is the benefit of Bellman-Ford? 
The Bellman-Ford algorithm is slower 
than Dijkstra's algorithm, but 
the Bellman-Ford algorithm can find 
the shortest paths in a graph 
with @(8) edge weights.
 
The Bellman-Ford algorithm is slower 
than Dijkstra's algorithm, but 
the Bellman-Ford algorithm can find 
the shortest paths in a graph 
with negative edge weights.
 Not CorrectClick here to try again. Correct!Next ❯ | 
This will reset the score of ALL 43 exercises.
Are you sure you want to continue?