Question Solved1 Answer Please please answer this question i have only twenty minutes QUESTION 4 10 MARKS A short road race has been organized by Q University for final year students. Students have to start at point A and use their own choice of route to reach endpoint J as quickly as possible. Figure 4 shows the network of roads available and the estimated time (in minutes) for each road. Hana is planning her strategy to win the race. Use Dijkstra's algorithm to find the route she should take, state her time for the race and draw the route. Show all your workings for each iteration in a table. 5 (в 10 E 5 1 5 4 5 2 2 1 3 4 4 5 A F 5 H 2 2 1 3 5 10 D 15 G Figure 4

B6IIZY The Asker · Advanced Mathematics

Please please answer this question i have only twenty minutes

Transcribed Image Text: QUESTION 4 10 MARKS A short road race has been organized by Q University for final year students. Students have to start at point A and use their own choice of route to reach endpoint J as quickly as possible. Figure 4 shows the network of roads available and the estimated time (in minutes) for each road. Hana is planning her strategy to win the race. Use Dijkstra's algorithm to find the route she should take, state her time for the race and draw the route. Show all your workings for each iteration in a table. 5 (в 10 E 5 1 5 4 5 2 2 1 3 4 4 5 A F 5 H 2 2 1 3 5 10 D 15 G Figure 4
More
Transcribed Image Text: QUESTION 4 10 MARKS A short road race has been organized by Q University for final year students. Students have to start at point A and use their own choice of route to reach endpoint J as quickly as possible. Figure 4 shows the network of roads available and the estimated time (in minutes) for each road. Hana is planning her strategy to win the race. Use Dijkstra's algorithm to find the route she should take, state her time for the race and draw the route. Show all your workings for each iteration in a table. 5 (в 10 E 5 1 5 4 5 2 2 1 3 4 4 5 A F 5 H 2 2 1 3 5 10 D 15 G Figure 4
See Answer
Add Answer +20 Points
Community Answer
RIZKWI
See all the answers with 1 Unlock
Get 4 Free Unlocks by registration

Solution:(1)Frstly, consider the Bare information aboutDijestra's Algorithm:Step. I) set lambda(S)=0 and for all vertices v!=s,lambda(v)=oo set T=V, the vertex set of G.Step-II) Let u be the vertex in T for which lambda(u) is minimum.Step-III) If u=t then stop.step IV) For Every Edge e=uv incident with w if v in T and lambda(v) > x(u)+ure) change the value of lambda(v) tolambda(v)+" wres. "step V :) change T to T-u and ... See the full answer