Question

1) for the following graph, write a program to find the minimum spanning tree, using either Kruskal or Prim algorithms. Calculate the time for your method. 1 A 4 9 3 B 8 7 6 5 D E 10 12 2 C 11 13 F G H

          1) for the following graph, write a program to find the minimum spanning tree, using
either Kruskal or Prim algorithms. Calculate the time for your method.
1
A
4
9
3
B
8
7
6
5
D
E
10
12
2
C
11
13
F
G
H

Added by Christine D.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Dominador Tan

Step 1

Here's how we can do it in Python: ```python graph = { 'A': [('B', 5), ('E', 10)], 'B': [('A', 5), ('E', 12), ('H', 11)], 'E': [('A', 10), ('B', 12), ('H', 43)], 'H': [('B', 11), ('E', 43)] } ``` Show more…

Show all steps

Thanks for your feedback!

((use adjacent list)) in python please.. 1) for the following graph; write program to find the minimum spanning tree, using either Kruskal or Prim algorithms. Calculate the time for your method B 5 E 10 12 11 43 H