1. Warm Up – 4.7 - Monday Calculate the Redundancy of the above network.
Draw two different spanning trees of the above network.
How many spanning trees does this network have?

2. Test Thursday Euler Paths and Circuits
Degree Sum and Edge relationship
# of Hamilton Circuits = (N-1)!
Weighted Graphs: Brute Force Algorithm, Nearest Neighbor Algorithm
Scheduling: Decreasing Time Algorithm, Critical Time Algorithm
Networks, Trees, and Spanning Trees
Kruskal’s Algorithm for Min and Max Spanning Trees

3. Minimum Spanning Trees
We use Kruskal’s Algorithm to find a minimum spanning tree.
How could we slightly modify Kruskal’s Algorithm to find the Max Spanning Tree?

4. Maximum Spanning Trees
We can find a max spanning tree by selecting the biggest weights and working our way down.
Remember: We cannot complete a circuit in order for a tree to be made.