The following table presents the implementation of Dijkstra's algorithm on the evaluated graph G with 8 vertices. a) What do the marks (0, {a}) and (∞, {x}) in the 1st row of the table mean? b) What do the marks marked in blue in the table mean? c) Reconstruct all edges of the graph G resulting from the first 5 rows of the table of Dijkstra's

Operations Research : Applications and Algorithms
4th Edition
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Wayne L. Winston
Chapter19: Probabilistic Dynamic Programming
Section19.4: Further Examples Of Probabilistic Dynamic Programming Formulations
Problem 7P
icon
Related questions
Question

The following table presents the implementation of Dijkstra's algorithm on the evaluated graph G with 8 vertices.

a) What do the marks (0, {a}) and (∞, {x}) in the 1st row of the table mean?

b) What do the marks marked in blue in the table mean?

c) Reconstruct all edges of the graph G resulting from the first 5 rows of the table of Dijkstra's algorithm.

d) How many different shortest paths exist in the graph G between the vertices a and g?

a
d
e
h
(0, {a}) | (∞, {b})| (0, {c})
(0, {a}) (3. {a})
(3, {a})
(3. {a})
(0, {d})
(4, {a})
(4, {a, c})
(4, {a, b, c})
(4, {a, b, c}) | (6, {c, d}) | (7, {b, d})
(0, {e})
(0,{f})
(00, {g})
(00, {h})
1.
(2, {a})
(2, {a})
2.
(6, {c})
(6, {c})
3.
(7, {b})
4.
(8, {d})
(8, {d, e})
(7, {b, d}) | (8, {d, e, f})
5.
(6, {c, d}) (7, {b, d})
6.
(9. {f})
(8, {d, e, f}) | (9, {f.g})
(9, {f.g})
7.
8.
9.
Transcribed Image Text:a d e h (0, {a}) | (∞, {b})| (0, {c}) (0, {a}) (3. {a}) (3, {a}) (3. {a}) (0, {d}) (4, {a}) (4, {a, c}) (4, {a, b, c}) (4, {a, b, c}) | (6, {c, d}) | (7, {b, d}) (0, {e}) (0,{f}) (00, {g}) (00, {h}) 1. (2, {a}) (2, {a}) 2. (6, {c}) (6, {c}) 3. (7, {b}) 4. (8, {d}) (8, {d, e}) (7, {b, d}) | (8, {d, e, f}) 5. (6, {c, d}) (7, {b, d}) 6. (9. {f}) (8, {d, e, f}) | (9, {f.g}) (9, {f.g}) 7. 8. 9.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Single source shortest path
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole