1564145
Answered

Welcome to Westonci.ca, the ultimate question and answer platform. Get expert answers to your questions quickly and accurately. Our platform provides a seamless experience for finding reliable answers from a network of experienced professionals. Explore comprehensive solutions to your questions from a wide range of professionals on our user-friendly 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 appreciate your time. Please revisit us for more reliable answers to any questions you may have. We hope this was helpful. Please come back whenever you need more information or answers to your queries. Westonci.ca is committed to providing accurate answers. Come back soon for more trustworthy information.