Question

Q1 (14 points) An undirected graph G is shown in Figure 1. Assume that the adjacency lists are in alphabetical order. Apply Dijkstra's shortest path algorithm to compute shortest paths from vertex A. 2 B F 1 3 A 20 8 11 D 11 22 C H 6 5 4 J K 7 Figure 1: Graph for Q1. On the answer sheet, answer questions regarding v.d and v.? for selected vertices.

          Q1 (14 points) An undirected graph G is shown in Figure 1. Assume that the adjacency lists are
in alphabetical order. Apply Dijkstra's shortest path algorithm to compute shortest paths
from vertex A.
2
B
F
1
3
A
20
8
11
D
11
22
C
H
6
5
4
J
K
7
Figure 1: Graph for Q1.
On the answer sheet, answer questions regarding v.d and v.? for selected vertices.

Q1 (14 points) An undirected graph G is shown in Figure 1. Assume that the adjacency lists are
in alphabetical order. Apply Dijkstra's shortest path algorithm to compute shortest paths
from vertex A.
2
B
F
1
3
A
20
8
11
D
11
22
C
H
6
5
4
J
K
7
Figure 1: Graph for Q1.
On the answer sheet, answer questions regarding v.d and v.? for selected vertices.

Added by Harold J.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Ali Karimiafshar

Step 1

Set the distance to start vertex A as 0 and to all other vertices as infinity. Set the predecessor of all vertices as undefined. Show more…

Show all steps

Thanks for your feedback!

Q1 (14 points) An undirected graph G is shown in Figure[1] Assume that the adjacency lists are in alphabetical order. Apply Dijkstra's shortest path algorithm to compute shortest paths from vertex A. A 20 Figure 1: Graph for Q1 On the answer sheet, answer questions regarding v.d and v.T for selected vertices