Question

write a Dijkstra's algorithm.​

Answer 1

$\huge\boxed{Answer}$

We step through Dijkstra's algorithm on the graph used in the algorithm above:

• We step through Dijkstra's algorithm on the graph used in the algorithm above:Initialize distances according to the algorithm.
• We step through Dijkstra's algorithm on the graph used in the algorithm above:Initialize distances according to the algorithm.Pick first node and calculate distances to adjacent nodes.
• We step through Dijkstra's algorithm on the graph used in the algorithm above: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.
• We step through Dijkstra's algorithm on the graph used in the algorithm above: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.

$\huge\mathfrak\red{itz\:Jyotsana☺}$

Answer 2

Answer:

It is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later.

mark this as brainliests answer.....