Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsShortest path algorithms

Bellman–Ford algorithm

Relax!

Report a typo

Given current shortest paths from $s$ to $u$ and $v$ , respectively: $d_u = 7$ and $d_v = 5$ . The weight of the edge $(u,v)$ is $w_{u,v} = -1$ . What is the result of relaxation along this edge?

Select one or more options from the list

Relaxation process is successful

Relaxation process is unsuccessful

The shortest distance from s to v is set equal to 4

The shortest distance from s to u is set equal to 6

None of the values change

___

Create a free account to access the full topic