Question

52 41 G 26 14 H 12 50 35 44 15 9 47 8 37 38 42 29 H 32 51 30 19 46 48 43 18 34 17 0 13 F

Consider the graph given above. Use Dijkstra's algorithm to find the shortest path between B and O.

a. List the vertices in the order they are visited as specified by the algorithm.

b. What is the total weight along the path?

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Dijkstra’s shortest-path algorithm to compute the shortest path from “B” to all network Vertices is as follows

12 A , 12,8 Ho,B 12,B 23,F 50, B2o,A D o, 3 20,A to, 8 55, 049,E2,G 5o,& 2o,A o, B

a) The vertices in the order they are visited as specified by the algorithm is

B-12-A-8-E-29-H-34-L-11-O = 94 [12+8+29+34+11]

41 26 J 12 50 8 37 29 H 19 18 34 13 F

b) The total weight along the path is 94

Add a comment
Know the answer?
Add Answer to:
Consider the graph given above. Use Dijkstra's algorithm to find the shortest path between B and ...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT