Dijkstra, Weighted Graph, Data Structure Algorithm, Algorithms, Graph Data Structure.
Edge Relaxation Edge relaxation is a important concept in algorithms regarding ‘shortest paths calculation’ like Dijkstra’s or Bellman-Ford algorithm. To make it concise you can edge relaxation is nothing but: if(d[u] + c(u,v) < d[v]) d[v] = d[u] + c(u,v) where, c(u,v) represents the cost/weight