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. Basics Graph- a diagram showing MST-minimum spanning tree Shortest route, the shortest path between all the places you need to go
4. MST Basics NO CYCLES ALLOWED! Algorithm- a problem solving procedure following a set of rules. Cycle-the nodes are connected by more than one edge.
5. Muddy City An 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. Kruskal Prim Reverse delete
7. Kruskal’s Algorithm Pick out the smallest edges Repeat step 1 as long as the edge selected does not create a cycle When all nodes have been connected you are done
14. Reverse-Delete Algorithm This is the opposite of Kruskal’s algorithm. Start with all edges Delete the longest edge Continue deleting longest edge as long as all nodes are connected and no cycles.
26. Prim’s Algorithm Pick 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.
37. MSTs Kruskal (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 MSTs We 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 MSTs MSTs are very fun to work with It helps you find the shortest route.
