Question

ICS-202 Online Assignment Sheet for Dijkstra's Algorithm 3) ( a . Pass initially 1 2 00 UT Active weight Predecessor Vertex - 8 8 8 8 8 8 8

Answer 1

In Dijkstra's algorithm, first of all insert all vertices into a queue Q with their corresponding weights of infinity. then select Source vertex set its weight 0. and extract a vertex u from Q having minimum weight. And then Relaxes all the edges leaving from vertex u. and reset the weights of all the adjacent vertices of u. and again extract another vertex u from queue Q having minimum weight  and reset the weights all adjacent vertices of u and relax edges leaving u. This process continues until priority queue becomes empty.

I solved the problem and attach the image file.

Solution of problem using Dijkstra's Algorithm 2 3 4 5 6 Pass Initially Active Vertex NI weight predecesso NIL