c) Given the following Graph and after applying Dijkstra algorithm, the final table looks as given below. 1 3 DE 5 Vertex known A T B T с T T T I J K F T G T H T T T H 4 18 T L T M T 10 20 d. 7 G 0 15 19 41 P H с M J 6 2 B 10 K 30 D 5 G 7 J 12 14 K 31 I 10 568 From this information, find out the shortest path from the source vertex B to vertex I, trace the path and also find out the shortest distance.
c) Given the following Graph and after applying Dijkstra algorithm, the final table looks as given below. 1 3 DE 5 Vertex known A T B T с T T T I J K F T G T H T T T H 4 18 T L T M T 10 20 d. 7 G 0 15 19 41 P H с M J 6 2 B 10 K 30 D 5 G 7 J 12 14 K 31 I 10 568 From this information, find out the shortest path from the source vertex B to vertex I, trace the path and also find out the shortest distance.
Related questions
Question
Transcribed Image Text:c) Given the following Graph and after applying Dijkstra algorithm, the final table looks
as given below.
1
Vertex
A
B
с
D
E
F
G
H
I
J
K
L
M
16
3 4
5
T
T
T
T
T
T
T
T
H
known
T
T
T
T
T
10
18
d.
19
41
11
6
2
20
7
0
15 H
с
M
P
G
J
10
K
30
D
5 G
7
J
14
K
31 T
10
560
From this information, find out the shortest path from the source vertex B to vertex I.
trace the path and also find out the shortest distance.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
