1564145
Answered

At Westonci.ca, we connect you with the answers you need, thanks to our active and informed community. Explore thousands of questions and answers from a knowledgeable community of experts ready to help you find solutions. Discover detailed answers to your questions from a wide network of experts on our comprehensive Q&A platform.

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 this was helpful. Please come back whenever you need more information or answers to your queries. Thank you for choosing our platform. We're dedicated to providing the best answers for all your questions. Visit us again. We're glad you visited Westonci.ca. Return anytime for updated answers from our knowledgeable team.