PDF (Acrobat) Document File
Be sure that you have an application to open this file type before downloading and/or purchasing.
0.28 MB | 9 pages
This packet teaches students step by step to:
Use vertex-edge graphs and algorithmic thinking to represent and find solutions to practical problems.
• Finding the shortest network connecting specified sites
• Finding a minimal route that includes every street (e.g., for trash pick-up)
• Finding the shortest route on a map from one site to another
• Finding the shortest circuit on a map that makes a tour of specified sites
Along the way examples are provided for each step. At the end, students get the opportunity to practice what they have learned from the tutorial.
Each concept is presented in straightforward language, with several examples. Great for review and remediation, perfect for filling in learning gaps!