IB Maths AI AHL 3.16: Tree and Cycle Algorithms Worksheet

Practise graph theory with this IB Maths AI AHL 3.16 Tree and Cycle Algorithms worksheet, including a teacher answer key. This 16-page printable PDF supports Mathematics: Applications and Interpretation Higher Level with structured questions on networks, minimum spanning trees and route optimisation.

Topics covered

• Walks, trails, paths, circuits and cycles
• Eulerian and Hamiltonian graphs, vertex degree and route reasoning
• Minimum spanning trees using Kruskal’s and Prim’s algorithms
• The Chinese Postman Problem and pairing odd vertices
• The Travelling Salesman Problem (TSP) and exact searches
• The nearest-neighbour algorithm for upper bounds
• The deleted-vertex algorithm for lower bounds
• Extended problems involving tied weights and comparing TSP bounds

What is included?

• Eleven question sections, A–K, from vocabulary to extended problems
• A teacher answer key with routes, calculations and explanations
• A printable worksheet for lessons, homework and independent revision

Use with the matching slides and notes to consolidate IB Maths AI AHL 3.16 and help students explain their algorithmic reasoning.

Complete the AHL 3.16 set

• Tree and Cycle Algorithms lesson slides
• Tree and Cycle Algorithms notes