Minimum Spanning Tree
- 1. MINIMUM spANNING Trees!By: Makenna , Emmely , and Jessica
- 2. What is a minimun spanning tree?A graph that connects all nodes together.A minimum spanning tree is used to find the shortest route.
- 3. BasicsGraph- a diagram showingMST-minimum spanning treeShortest route, the shortest path between all the places you need to go
- 4. MST BasicsNO CYCLES ALLOWED!Algorithm- a problem solving procedure following a set of rules.Cycle-the nodes are connected by more than one edge.
- 5. Muddy CityAn example would be having to use the least amount of paving stones to pave roads so that every house could be connected to every other house indirectly.
- 6. What is an MST Algorithm?An MST algorithm is a way to show the shortest distance.There are many different algorithms.KruskalPrimReverse delete
- 7. Kruskal’s AlgorithmPick out the smallest edgesRepeat step 1 as long as the edge selected does not create a cycleWhen all nodes have been connected you are done
- 8. Kruskal #0
- 9. Kruskal #1
- 10. Kruskal #2
- 11. Kruskal #3
- 12. Kruskal #4
- 14. Reverse-Delete AlgorithmThis is the opposite of Kruskal’s algorithm.Start with all edges Delete the longest edgeContinue deleting longest edge as long as all nodes are connected and no cycles.
- 26. Prim’s AlgorithmPick out a node.Pick out the shortest edge that is connected to your tree so far as long as it doesn’t create a cycle.Continue this until all nodes are covered.
- 27. Prim #1
- 28. Prim #2
- 29. Prim #3
- 30. Prim #4
- 31. Prim #5
- 32. Prim #6
- 33. Prim #7
- 34. Prim #8
- 35. Prim #9
- 36. Prim #10
- 37. MSTsKruskal (1956) and Prim (1967)MSTs make our life easier and we save money by using short paths.MST’s was first seen in Poland, France , The Czech Republic and Slovokia Czechoslovakia.
- 38. Importance of MSTsWe need it in computer science because it prevents loops in a switched network with redundant paths.It’s one of the oldest and most basic graphs in theoretical computer science.
- 39. Why We Love MSTsMSTs are very fun to work with It helps you find the shortest route.
- 40. ANY QUESTIONS?