title: Relaxation of an edge in Dijkstra's algorithm
body: <p>What does <strong><code>relaxation of an edge</code></strong> mean in the context of graph theory ? I came across this while studying up on Dijkstra's algorithm for single source shortest path.</p>