IB Maths AI HL AHL 3.16 (HL)—Graph algorithms Question Bank

• Use walks, trails, paths, circuits, cycles, Eulerian trails/circuits and Hamiltonian paths/cycles.

• Use Kruskal's and Prim's algorithms for minimum spanning trees.

• Solve Chinese postman problems for weighted graphs with up to four odd vertices.

• Use nearest-neighbour and deleted-vertex algorithms for travelling salesman bounds.