This answer is restricted. Please login to view the answer of this question.Login Now
The Dijkstra’s algorithm finds the shortest path from a particular node, called the source node to every other node in a connected graph. It produces a shortest path tree with the source node as the root. It is profoundly used in computer networks to generate optimal routes with the aim of minimizing routing costs.
Precondition: G = (V, w) is a weighted graph with initial vertex v0 then it holds following steps:
Below is a directed weighted graph. We will find shortest path between all the vertices using Dijkstra’a Algorithm.
Click here to submit your answer.