Below is a adjacency list of a weighted graph (For each edge the weight is shown after node):
A: D-4 C-9 B-5 F-4 K-5 B: D-4 A-5 C: A-9 M-6 E-3 D: A-4 B-4 G-6 E: C-3 F: A-4 I-4 G: D-6 H-3 I-1 H: G-3 J-3 I: F-4 G-1 L-5 J-2 K-2 J: H-3 I-2 L-1 M-3 K: I-2 A-5 M-3 L: I-5 M-9 J-1 M: C-6 J-3 L-9 K-3
Represent the shortest-path spanning tree with root node K using Dijkstra's algorithm. Hint: click the edges between nodes to produce the path in insert order.
You can send an answer to this assignment at most 2 times.