CODEWITHSUNDEEP
algorithmminimum-spanning-treeprims-algorithm
Student123
Student123

Reputation: 7

Prim’s MST Algorithm

I just finished an exercise on the application of Prim's theorem. However, I don't have the solution to this problem, but I found an answer in this exercise. Could someone verify that the solution I got is correct ? Here is the statement:enter image description here

Thanks in advance !

For this exercise I found the following sequence: B-C, B-H, H-A, A-I, I-F, F-G, G-E, E-D Total cost: 2+3+7+4+5+1+9+17 = 48

Upvotes: 0

Views: 54

Answers (0)

Related Questions