Like this presentation? Why not share!

- Prim's Algorithm on minimum spannin... by oneous 30770 views
- Spanning trees & applications by Tech_MX 8656 views
- ADA - Minimum Spanning Tree Prim Kr... by Sahil Kumar 5120 views
- My presentation minimum spanning tree by Lon Salva 7437 views
- KRUSKAL'S algorithm from chaitra by guest1f4fb3 8850 views
- Minimum spanning Tree by Narendra Singh Patel 1848 views

No Downloads

Total Views

4,166

On Slideshare

0

From Embeds

0

Number of Embeds

0

Shares

0

Downloads

0

Comments

0

Likes

10

No embeds

No notes for slide

- 1. MINIMUM spANNING Trees!<br />By: Makenna , Emmely , and Jessica <br />
- 2. What is a minimun spanning tree?<br />A graph that connects all nodes together.<br />A minimum spanning tree is used to find the shortest route.<br />
- 3. Basics<br />Graph- a diagram showing<br />MST-minimum spanning tree<br />Shortest route, the shortest path between all the places you need to go<br />
- 4. MST Basics<br />NO CYCLES ALLOWED!<br />Algorithm- a problem solving procedure following a set of rules.<br />Cycle-the nodes are connected by more than one edge.<br />
- 5. Muddy City<br />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.<br />
- 6. What is an MST Algorithm?<br />An MST algorithm is a way to show the shortest distance.<br />There are many different algorithms.<br />Kruskal<br />Prim<br />Reverse delete<br />
- 7. Kruskal’s Algorithm<br />Pick out the smallest edges<br />Repeat step 1 as long as the edge selected does not create a cycle<br />When all nodes have been connected you are done<br />
- 8. Kruskal #0<br />
- 9. Kruskal #1<br />
- 10. Kruskal #2<br />
- 11. Kruskal #3<br />
- 12. Kruskal #4<br />
- 13. Kruskal #5<br />28 stones<br />
- 14. Reverse-Delete Algorithm<br />This is the opposite of Kruskal’s algorithm.<br />Start with all edges <br />Delete the longest edge<br />Continue deleting longest edge as long as all nodes are connected and no cycles.<br />
- 15. Reverse-Delete #1<br />
- 16. Reverse-Delete #2<br />
- 17. Reverse-Delete #3<br />
- 18. Reverse-Delete #4<br />
- 19. Reverse-Delete #5<br />
- 20. Reverse-Delete #6<br />
- 21. Reverse-Delete #7<br />
- 22. Reverse-Delete #8<br />
- 23. Reverse-Delete #9<br />
- 24. Reverse-Delete #10<br />
- 25. Reverse-Delete #11<br />
- 26. Prim’s Algorithm<br />Pick out a node.<br />Pick out the shortest edge that is connected to your tree so far as long as it doesn’t create a cycle.<br />Continue this until all nodes are covered.<br />
- 27. Prim #1<br />
- 28. Prim #2<br />
- 29. Prim #3<br />
- 30. Prim #4<br />
- 31. Prim #5<br />
- 32. Prim #6<br />
- 33. Prim #7<br />
- 34. Prim #8<br />
- 35. Prim #9<br />
- 36. Prim #10<br />
- 37. MSTs<br />Kruskal (1956) and Prim (1967)<br />MSTs make our life easier and we save money by using short paths.<br />MST’s was first seen in Poland, France , The Czech Republic and Slovokia Czechoslovakia.<br />
- 38. Importance of MSTs<br />We need it in computer science because it prevents loops in a switched network with redundant paths.<br />It’s one of the oldest and most basic graphs in theoretical computer science. <br />
- 39. Why We Love MSTs<br />MSTs are very fun to work with <br />It helps you find the shortest route.<br />
- 40. ANY QUESTIONS?<br />
- 41. Thanksfor listening!<br />

No public clipboards found for this slide

×
### Save the most important slides with Clipping

Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.

Be the first to comment