Edge Relaxation

This is a technique used to prove Dijkstra’s Algorithm and Bellman-Ford Algorithm.

https://www.baeldung.com/cs/dijkstra-edge-relaxation

• Okay, I think I understand this now.

The $\delta$ value is the lenght of the shortest path, and we want to make a proof about the value of d