1564145idn
Answered

Get the information you need quickly and easily with IDNLearn.com. Receive prompt and accurate responses to your questions from our community of knowledgeable professionals ready to assist you at any time.

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 :

Sqdancefanidn

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 are happy to have you as part of our community. Keep asking, answering, and sharing your insights. Together, we can create a valuable knowledge resource. Thank you for choosing IDNLearn.com for your queries. We’re here to provide accurate answers, so visit us again soon.