Discrete Math: Spanning Trees and Prim's and Kruskal's Algorithms
Secondary Math Success
104 Followers
Grade Levels
6th - 12th, Higher Education
Subjects
Resource Type
Formats Included
- Zip
Pages
56 pages
Secondary Math Success
104 Followers
Description
This is a graph theory lesson from Discrete Math on spanning trees, minimum weight spanning trees, Prim's Algorithm, and Kruskal's Algorithm for middle/high school/college students. Included: 2 sets of lesson slides (one on trees and spanning trees, the other on minimum weight spanning trees, Prim, and Kruskal Algorithms), practice worksheet covering all topics, and key.
Total Pages
56 pages
Answer Key
Included
Teaching Duration
2 days
Report this resource to TPT
Reported resources will be reviewed by our team. Report this resource to let us know if this resource violates TPT’s content guidelines.