Wednesday, September 28, 2022
HomeSoftware DevelopmentEdge Leisure Property for Dijkstra’s Algorithm and Bellman Ford's Algorithm

Edge Leisure Property for Dijkstra’s Algorithm and Bellman Ford’s Algorithm

Within the discipline of graph principle, varied shortest path algorithms particularly Dijkstra’s algorithm and Bellmann-Ford’s algorithm repeatedly make use of using the approach known as Edge Leisure. 

The concept of leisure is similar in each algorithms and it’s by understanding, the ‘Leisure property‘ we are able to totally grasp the working of the 2 algorithms.  


The Edge Leisure property is outlined because the operation of enjoyable an edge u → v by checking whether or not the best-known method from S(supply) to v is to go from S → v or by going by way of the sting u → v. If it’s the latter case we replace the trail to this minimal value.

Initially, the reaching value from S to v is ready infinite(∞) and the price of reaching from S to S is zero.


Representing the price of a relaxed edge v mathematically,

d[v] = min{ d[v], d[u] + c(u, v) } 

And the fundamental algorithm for Leisure can be :

if ( d[u] + c(u, v) < d[v] ) then

d[v] = d[u] + c(u, v)

the place d[u] represents the reaching value from S to u

d[v] represents the reaching value from S to v
c(u, v) represents reaching value from u to v

Fixing Single Supply Shortest Path drawback by Edge Leisure methodology

  • In single-source shortest paths issues, we have to discover all of the shortest paths from one beginning vertex to all different vertices. It’s by enjoyable an edge we check whether or not we are able to enhance this shortest path(by way of the grasping strategy methodology).
  • Which means throughout traversing the graph and discovering the shortest path to the ultimate node, we replace the prices of the paths now we have for the already identified nodes as quickly as we discover a shorter path to succeed in it. 
  • The beneath instance, will clear and totally clarify the working of the Leisure property.
  • The given determine reveals graph G and now we have to search out the minimal value to succeed in B from supply S.


Enter: graph – G

Let A be u and B be v.

The gap from supply to the supply can be 0.
=> d[S] = 0

Additionally, initially, the gap between different vertices and S can be infinite.


for every vertex v within the graph

d[v] = ∞
d[S] = 0

Initialization of graph

Now we begin enjoyable A.

The shortest path from vertex S to vertex A is a single path ‘S → A’.

d[u] = ∞

As a result of, d[S] + c(S, u) < d[u]
d[u] = d[S] + c(S, u) = 0 + 20
=> d[u] = 20

Graph after enjoyable A

Now we loosen up vertex B. 

The method stays the identical the one distinction we observe is that there are two paths resulting in B. 

The trail I: ‘S→B’
Path II: ‘S→A→B’

First, contemplate going by way of the trail I – d[v] = ∞

As a result of, d[S] + c(S, v) < d[v]
d[v] = d[S] + c(S, v) = 0 + 40
=> d[v] = 40

Since its a decrease worth than the earlier initialized d[v] is up to date to 40, however we are going to now proceed to checking path II as per the grasping methodology strategy.

d[v] = 40
As a result of, d[u] + c(u, v) < d[v]
d[v] = d[u] + c(u, v) = 20 + 10
=> d[v] = 30

Because the new d[v] has a decrease value than the earlier of case I we once more replace it to the brand new obtained by taking path II. We can not replace the d worth to any decrease than this, so we end the sting leisure.

Remaining Graph with smallest value to succeed in the vertices A and B after enjoyable B

Finally we get the minimal value to succeed in one another vertices within the graph from the supply and therefore fixing the only supply shortest path drawback.

Lastly, we are able to conclude that the algorithms for the shortest path issues (Dijkstra’s Algorithm and Bellman-Ford Algorithm) might be solved by repeatedly utilizing edge leisure.



Please enter your comment!
Please enter your name here

Most Popular

Recent Comments