Shortest Path & Minimum Spanning Tree (Year 12)
Free printable Year 12 General Mathematics worksheet on weighted networks: shortest path between two vertices and the minimum spanning tree (ACMGM078, ACMGM084, ACMGM101-103). Clear network diagrams with a computed answer key.
✓ Answer key checked by math, never wrong
Year 12 · Math worksheet
Name
Date
Math
Networks: Shortest Path and Minimum Spanning Tree
Read the weighted network diagram. Find the length of the shortest path between the two named vertices, or the total weight of the minimum spanning tree that connects every vertex. The answer key highlights one correct path or tree.
- 1.In the weighted network shown, find the length (total weight) of the shortest path from A to O.
Find the shortest path from A to O. - 2.In the weighted network shown, find the length (total weight) of the shortest path from A to F.
Find the shortest path from A to F. - 3.In the weighted network shown, find the length (total weight) of the shortest path from A to E.
Find the shortest path from A to E. - 4.In the weighted network shown, find the length (total weight) of the shortest path from A to O.
Find the shortest path from A to O. - 5.The weighted network shown gives the cost of connecting the sites. Find the total weight of the minimum spanning tree (the cheapest way to connect every site).
Find the minimum spanning tree (cheapest connection of all sites). - 6.The weighted network shown gives the cost of connecting the sites. Find the total weight of the minimum spanning tree (the cheapest way to connect every site).
Find the minimum spanning tree (cheapest connection of all sites). - 7.The weighted network shown gives the cost of connecting the sites. Find the total weight of the minimum spanning tree (the cheapest way to connect every site).
Find the minimum spanning tree (cheapest connection of all sites). - 8.The weighted network shown gives the cost of connecting the sites. Find the total weight of the minimum spanning tree (the cheapest way to connect every site).
Find the minimum spanning tree (cheapest connection of all sites).
Made with ChalkBee · chalkbee.com