Challenge: Find the Minimum Spanning Tree
Given an undirected weighted graph, find its minimum spanning tree.
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 |
Access this course and 1400+ top-rated courses and projects.