Menu
×
×
Correct!
Exercise:How does the Bellman-Ford algorithm work? (V is the number of vertices in the graph.)
The Bellman-Ford algorithm
finds the shortest paths
by basically just checking
(relaxing) all @(5) V-1 times.
The Bellman-Ford algorithm
finds the shortest paths
by basically just checking
(relaxing) all edges V-1 times.
Not CorrectClick here to try again. Correct!Next ❯ |
This will reset the score of ALL 43 exercises.
Are you sure you want to continue?