Challenge: Find the Minimum Spanning Tree
Explore how to find the minimum spanning tree of a weighted graph using greedy algorithms in Java. Understand the MST concept, work through implementing edge and disjoint set classes, and design a step-by-step solution to optimize graph connections without cycles.
We'll cover the following...
We'll cover the following...
Problem statement
Implement a function that returns the minimum spanning tree of the given graph.
Input
The input is an undirected weighted graph.
Output
The output is a possible minimum spanning tree.
Sample input
| Source | Destination | Weight |
|---|---|---|
| 0 | 1 | 10 |
| 0 | 2 | 6 |
