Shown in the below graph are 9 data centers identified as a, b, c, d, e, f, g, h & i. The cost of moving data between these centers (the data lines) are also shown. Using either Prim's or Kruskal's algorithm, construct the minimum spanning tree. Give a sketch of the minimum spanning tree. 5 14 a g 10 11 12 13 b 16 A) h 9 4 8 15 E 3 I

icon
Related questions
Question
Shown in the below graph are 9 data centers identified as a, b, c, d, e, f, g, h & i.
The cost of moving data between these centers (the data lines) are also shown.
Using either Prim's or Kruskal's algorithm, construct the minimum spanning tree.
Give a sketch of the minimum spanning tree.
5
a
d
14
bo
g
10
1
11
12
13
b
16
e
h
9
6
4
8
15
2
3
I
Transcribed Image Text:Shown in the below graph are 9 data centers identified as a, b, c, d, e, f, g, h & i. The cost of moving data between these centers (the data lines) are also shown. Using either Prim's or Kruskal's algorithm, construct the minimum spanning tree. Give a sketch of the minimum spanning tree. 5 a d 14 bo g 10 1 11 12 13 b 16 e h 9 6 4 8 15 2 3 I
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer