1. Spanning Tree

2. How to make a spanning tree
Start by labeling the starting point with a 0 and darkening it in.
Every point that is adjacent to this darkened in point label with a 1.
Darken the edge that connects a 0 with a 1.
Make sure not to make a cycle.
Repeat these steps increasing the counter by 1 each time. Be carful to not make cycles

3. Start here 1 3 2 4 5

4. Kruskal’s Minimum Spanning Tree

5. To Do Kruskal
Darken in the smallest edge and its points. Brake ties arbitrarily.
Continue darkening the smallest value making sure not to form a cycle.
When you have a connected graph and all the points darkened in you are done.

6. 4 3 9 15 5 10 4 6 11 8 8 6 19 4 5 12 9 12 11 10 3

7. Prim’s Minimum Spanning Tree

8. To do Prim Darken in the smallest edge and its points
From now on darken in the smallest edge that connect a darkened in point to a non-darkened in point.(The edges are always adjacent to each other)
When all the points are darkened in you are done.

9. 4 3 9 15 5 10 4 6 11 8 8 6 19 4 5 12 9 12 11 10 3

10. Now do Page , , 18, 19