Page
Find the shortest path from node A to all
nodes in groph using Dijkshtro's algorithm ?
6
H
A
5
E
Answers
Answered by
1
Answer:
Explanation:
Initialize distances according to the algorithm.
Pick first node and calculate distances to adjacent nodes.
Pick next node with minimal distance; repeat adjacent node distance calculations.
Final result of shortest-path tree.
Similar questions