1564145
Answered

Welcome to Westonci.ca, where your questions are met with accurate answers from a community of experts and enthusiasts. Join our Q&A platform to get precise answers from experts in diverse fields and enhance your understanding. Connect with a community of professionals ready to help you find accurate solutions to your questions quickly and efficiently.

What is the weight of the minimum spanning tree for the graph above found using Kruskal's Algorithm? ​

What Is The Weight Of The Minimum Spanning Tree For The Graph Above Found Using Kruskals Algorithm class=

Sagot :

sqdancefan

Answer:

  39

Step-by-step explanation:

Kruskal's Algorithm has you add edges in order of weight, from least to greatest, excluding edges that form loops, until all nodes are connected.

__

Here, the edges have weights ...

  5 -- AD, CE

  6 -- DF

  7 -- AB, BE

  8 -- BC, EF

  9 -- BD, EG

  11 -- FG

  15 -- DE

The edges shown in bold are ones that can be added without creating loops. Their total weight is 5×2 +6 +7×2 +9 = 39.

The weight of the minimum spanning tree is 39.

We hope you found this helpful. Feel free to come back anytime for more accurate answers and updated information. We appreciate your time. Please come back anytime for the latest information and answers to your questions. Get the answers you need at Westonci.ca. Stay informed by returning for our latest expert advice.