Discrete Math Every Answer Every Question Given However Calculations Given Task Accepts P Q43823097
Discrete math:
Every answer to every question is given below. However, thecalculations are not given.
The task for you who accepts this problem is to show allcalculations for every question below
Dijkstra’s algorithm is given below
3 2 6 7 8 6 2 1 No Problem 3 (8 %) In this problem we use Dijkstra’s algorithm (see Figure 2 on Page 11) on the graph in Figure 1. 1. What is the length of the shortest path from a to z (found by Dijkstra’s algorithm)? 07 08 09 10 11 12 13 14 2. Whats the order of vertricies added to the set S? (a, e, f,j,z 1 a,e,b,f,i,j,z a, b, c, d, e, f, g, h, i, j, k, z I a,e,i,j,z I a, e, f, g, X a, e, f,i,j, b, z a,e, f,i,j,z 3. Why does graph 1 not have en Euler circut? Why does graph 1 not have an Euler path? And why does graph one have a Hamilton circut? 4. What is the weight of a minimum spanning tree of the graph in Figure 1. ( 14 15 16 17 18 19 20 21 procedure Dijkstra(G: weighted connected simple graph, with all weights positive) {G has vertices a = vo, VI, …,Vn = z and lengths w(Vi, V;) where w(Vi, V;) = o if {vi, Vj} is not an edge in G} for i :=1 to n L(vi) := L(a):= 0 S:=0 {the labels are now initialized so that the label of a is 0 and all other labels are o, and S is the empty set} while z & S u := a vertex not in S with L(u) minimal S:= SU{u} for all vertices v not in S if L(u) + w(u, v) < L(v) then L(v):= L(u) + w(u, v) {this adds a vertex to S with minimal label and updates the labels of vertices not in S} return L(z) {L(z) = length of a shortest path from a to z} Figure 2: Show transcribed image text 3 2 6 7 8 6 2 1 No Problem 3 (8 %) In this problem we use Dijkstra’s algorithm (see Figure 2 on Page 11) on the graph in Figure 1. 1. What is the length of the shortest path from a to z (found by Dijkstra’s algorithm)? 07 08 09 10 11 12 13 14 2. Whats the order of vertricies added to the set S? (a, e, f,j,z 1 a,e,b,f,i,j,z a, b, c, d, e, f, g, h, i, j, k, z I a,e,i,j,z I a, e, f, g, X a, e, f,i,j, b, z a,e, f,i,j,z 3. Why does graph 1 not have en Euler circut? Why does graph 1 not have an Euler path? And why does graph one have a Hamilton circut? 4. What is the weight of a minimum spanning tree of the graph in Figure 1. ( 14 15 16 17 18 19 20 21
procedure Dijkstra(G: weighted connected simple graph, with all weights positive) {G has vertices a = vo, VI, …,Vn = z and lengths w(Vi, V;) where w(Vi, V;) = o if {vi, Vj} is not an edge in G} for i :=1 to n L(vi) := L(a):= 0 S:=0 {the labels are now initialized so that the label of a is 0 and all other labels are o, and S is the empty set} while z & S u := a vertex not in S with L(u) minimal S:= SU{u} for all vertices v not in S if L(u) + w(u, v)
Expert Answer
Answer to Discrete math: Every answer to every question is given below. However, the calculations are not given. The task for you …
OR