---
# System prepended metadata

title: 'Lab 33: Spanning Trees'

---

# Lab 33: Spanning Trees

## Problem: Minimum Spanners
### a.
A,C,E,G,H,D,B,F
A,B,D,F,H,G,E,C
A,B,F,D,C,E,G,H
### b.
A,B,F,D,C,E,G,H
3,5,3,2,4,2,1
### c.
Remove the largest edges that don't remove all connections to a node.
If some edges have equal weights remove one only if removing this edge does not disconnect the node from the graph.

Pick any starting node
Always choose the least weighted edge that has not been used and does not connect a node already in the spanning tree that is connected

### d.
Pick any starting node, always choose the least weighted edge that has not been used and does not connect a node already in the spanning tree that is connected.
