What is a Minimum Spanning Tree (MST)?

What is a Minimum Spanning Tree (MST)?

Approach: Define a subset of edges connecting all vertices with minimum total weight.

A subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight.

Follow-up: Can a graph have multiple MSTs?

Key concepts: spanning tree, minimum weight, connectivity.