# Minimum spanning tree (MST)

Given an undirected weighted graph G = (V, E),

MST is given by V, subset of E such that |E| = |V| - 1, and V connects all edges.

# How to find an MST of a grapn G?

Cut property^{ᛦ}

### Greedy methods

Prims algorithm^{ᛦ}

Given an undirected weighted graph G = (V, E),

MST is given by V, subset of E such that |E| = |V| - 1, and V connects all edges.

Cut property^{ᛦ}

Prims algorithm^{ᛦ}