| A | B | C | D | E | F | |
|---|---|---|---|---|---|---|
| A | -- | 6 | 44 | 14 | 7 | 21 |
| B | 6 | -- | 24 | 20 | 1 | 4 |
| C | 44 | 24 | -- | 9 | 2 | 17 |
| D | 14 | 20 | 9 | -- | 11 | 38 |
| E | 7 | 1 | 2 | 11 | -- | 40 |
| F | 21 | 4 | 17 | 38 | 40 | -- |
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?
- Question Help:
- Video