Question

| | A | B | C | D | E | F | |---|---|---|---|---|---|---| | A | -- | 40 | 4 | 13 | 10 | 1 | | B | 40 | -- | 41 | 35 | 24 | 28 | | C | 4 | 41 | -- | 17 | 16 | 45 | | D | 13 | 35 | 17 | -- | 29 | 33 | | E | 10 | 24 | 16 | 29 | -- | 43 | | F | 1 | 28 | 45 | 33 | 43 | -- | The weights of edges in a graph are shown in the table above. Find the minimum cost spanning tree on the graph above using Kruskal's algorithm. What is the total cost of the tree?

          | | A | B | C | D | E | F |
|---|---|---|---|---|---|---|
| A | -- | 40 | 4 | 13 | 10 | 1 |
| B | 40 | -- | 41 | 35 | 24 | 28 |
| C | 4 | 41 | -- | 17 | 16 | 45 |
| D | 13 | 35 | 17 | -- | 29 | 33 |
| E | 10 | 24 | 16 | 29 | -- | 43 |
| F | 1 | 28 | 45 | 33 | 43 | -- |

The weights of edges in a graph are shown in the table above. Find the minimum cost spanning tree on the graph above using Kruskal's algorithm. What is the total cost of the tree?

| | A | B | C | D | E | F |
|—|—|—|—|—|—|—|
| A | – | 40 | 4 | 13 | 10 | 1 |
| B | 40 | – | 41 | 35 | 24 | 28 |
| C | 4 | 41 | – | 17 | 16 | 45 |
| D | 13 | 35 | 17 | – | 29 | 33 |
| E | 10 | 24 | 16 | 29 | – | 43 |
| F | 1 | 28 | 45 | 33 | 43 | – |

The weights of edges in a graph are shown in the table above. Find the minimum cost spanning tree on the graph above using Kruskal's algorithm. What is the total cost of the tree?

Added by John M.

Calculus: Early Transcendentals

James Stewart 8th Edition

Instant Answer

Solved by Expert Adi S

09/02/2023

Step 1

Sort the edges in ascending order based on their weights: H-24, 29-28, 43-745, 733-745, 28-733, 28-43 Show more…

Show all steps

Thanks for your feedback!

The weights of edges in a graph are shown in the table above. Find the minimum cost spanning tree on the graph above using Kruskal's algorithm. What is the total cost of the tree?