IB Mathematics Applications & Interpretation AHL 3.16—tree and Cycle Algorithms, Chinese Postman, Travelling Salesman

Question Type 1: Finding minimum spanning trees by applying Prim's algorithm

Question Type 2: Finding minimum spanning trees by applying Kruskal's algorithm

Question Type 3: Applying minimum spanning trees under real world context

Question Type 4: Finding the shortest path in weighted graphs using Dijkstra's Algorithm

Question Type 5: Using Floyd-Warshall for all pairs shortest path

Question Type 6: Applying algorithm to find the shortest route covering every edge once

Question Type 7: Applying the postman problem to real world contexts

Question Type 8: Applying different approaches to solve the traveling salesman problem

Question Type 9: Applying the traveling salesman problem in real world contexts