Discrete Structures20785 marksShortest Path Algorithm
Illustrate the Dijkstra's Algorithm to find the shortest path from source node to destination node with an example.
Illustrate the Dijkstra's Algorithm to find the shortest path from source node to destination node with an example. [5]
Dijkstra's Algorithm, discovered by E.W. Dijkstra, finds the shortest path between two vertices in a weighted graph. The length of a path is the sum of the weights of its edges, and the shortest path is the minimum length path between two vertices. --- 1. Assign distance 0 to the source node and ...