Edge Relaxation

The fundamental operation behind shortest-path algorithms

Click "Next Step" to begin the relaxation procedure
u d[u] = 5
w = 3
v d[v] = 10
Relaxation check
Source node u
Checking condition
Updated (relaxed)