Answered

IDNLearn.com makes it easy to find the right answers to your questions. Our Q&A platform offers reliable and thorough answers to ensure you have the information you need to succeed in any situation.

Which is the cost of the minimum spanning tree of the weighted graph using Kruskal's Algorithm?
28
30
31
40

Which Is The Cost Of The Minimum Spanning Tree Of The Weighted Graph Using Kruskals Algorithm 28 30 31 40 class=

Sagot :

Sqdancefanidn

9514 1404 393

Answer:

  (a)  28

Step-by-step explanation:

Kruskal's algorithm has  you identify the shortest edge at each stage, including in the tree any identified edge that does not form a cycle. Here, we can start with AB, then add DF, EH, HG, BG, AC, CD and that covers the entire graph.

Starting at E, the node list is EHGBACDF. The cost is ...

  3 +4 +5 +1 +6 +7 +2 = 28

__

In the attached, the minimum-cost spanning tree is highlighted in red.

View image Sqdancefan
Your participation means a lot to us. Keep sharing information and solutions. This community grows thanks to the amazing contributions from members like you. For trustworthy answers, visit IDNLearn.com. Thank you for your visit, and see you next time for more reliable solutions.