Algorithm 1. Modified Dijkstra's Algorithm for Computing Top-k (G, w,q, k) 1: S q) // q the query node 5, G is the graph, w is the weight 2: K- ) / set of shortest path from the source to the destination 3 for nlndex-0:k do u = EXTRACT-MIN (S-K) RELAX(u. v. w) 5: S S U G. Adj[11] for each vertex ue G. Adj[11] do w(u, V RELAX (u, v, w) end for 10 end fo Please work on the following simple graph for demonstrating the running process of Algorithm 1. q5, k-4 Use 1(0.5) to represent node 1 and its shortest path length 0.5 at that iteration 0.5 0.5 0.8 0.651.0 1)05 4 30.65 0.6 0.6 Before the iteration After the iteration iteratio sets values