Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsShortest path algorithms

Bellman–Ford algorithm

Guess the output

Report a typo

Consider the directed graph:

What is the output of the Bellman-Ford algorithm?

Let the array of shortest paths be in the following order: $d_1, \;d_2, \;d_3, \; d_4, \; d_5$ . What is the output of the Bellman-Ford algorithm if node $1$ is picked as the source node?

Select one option from the list

Returns the following array of shortest paths: 0, 2, -3, -2, 1

Returns the following array of shortest paths: 0, 2, -INF, -INF, -INF

Terminates and notifies that some negative cycle has been found

Loops forever

___

Create a free account to access the full topic