Question 2: Using Dijkstra's algorithm, find and draw a minimal spanning tree rooted at 1 for the weighted graph, H :
11
Question 2: Using Dijkstra's algorithm, find and draw a minimal spanning tree rooted at 1 for the weighted graph, H:
3
2
-
2
2
1
2
3
1
6
2
-
1
4
2
3
10
2
H