Question

Discrete Mathematics with Applications by Susanna Epp, 4th Ed.

Chapter 10.7, Exercise Question 14:

Use Dijkstra's algorithm to find find the shortest path from a to z for each of the graphs in 14. In each case make tables similar to Table 10.7.1 to show the action of the algorithm.

14. b 1c1d 7 8 a 4 e 1 f 1 g 20 1 Table 10.7.1 V(T) E(T) Step F L(a) L(b) L(c) L(d) L(e) L(2) (a a) la) (b, c (c, d, e (d, e 0 3 4 (a, b) {{a, b}) 2 10 3 4 8 (a, b, c {la, b), fa,c} 3 10 3 4 9 5 a, b, c, e) {la, b). (a, c), (c, e}} 4 (d, z} 0 3 4 5 17 7 {{a, b), (a, c), (c, e), (e, d}} (a, b, c, e, d) 5 {z) 0 3 7 5 14 {{a, b}, (a, c, (c, el. (e, d), (e, z)) fa, b, c, e, d, z) nnn 8 8 88

Answer 1

Solution is here attached with.Hope this will help you solve the problem , if you have any query you can ask.

E(T F Lla) LbLLOLaue ufUguz 00 00 00 00 be { 00 Cei 2 00 4 800 0 jo,b1,[bel LOb),bJ,d fa,b,c,defab),[be1, [ed] La, el Lorb),[b1.Lodl, La.e], Le s0,be3 2 3 4 8 HO 00 fabed 1 2 3 4 8 10 23 0 1 3 45 10 23 2 fa,bcde 2 3 456 2,3 1 2 45 6 0,b.cd.e lsb.[be], Led], L4,el, Cef. Zasbgde So ,tu shortst path Tram a to umld to 17

Thank you