---
# System prepended metadata

title: 'Lab 14, Algoritms Over Trees'

---

# Lab 14, Algoritms Over Trees
## Problem: Minimum Spanners
Solomon Golden, Elizabeth Zimmerman, Nicolas Cardenas
a.
Breadth - First: AB, AC, BF, BD, CE, EG, GH

Left- HF, FB, BA, HD, DC, HE, HG.

Outer- FB, BA, AC, CE, EG, GH, HD

b.
HG, GE, EC, CD, DF, FB, BA
1 + 2 + 4 + 2 + 3 + 5 + 3 = 20

c.
1. At the parent, look at which edge to child has a lesser weight. Choose that path.

2. Look at the sum of all the weights of edges to all unseen nodes from your root node, paths to nodes that have been traveled to may go through nodes that have been gone to. Choose the smallest path of options calculated.

d. To find the MST with the method "Start with a MST of one node and then grow the MST incrementally from there.", the method we described c.2 could apply. Starting at the root of a tree with one node, we would then recursively increase the number of nodes we would go through by 1 each time. In each iteration, we would choose the best case for the least weight from the last node we travelled to the next node, going through nodes we have travelled to before.