Find the shortest route that traverses every edge of a graph. HL AI Paper 3 territory — needs an Eulerian analysis + pairing of odd-degree vertices.
Practise The Chinese Postman problem with AI marking
Open the full HL AI engine — every question in this unit is worked through with instant AI-graded feedback on your handwritten workings.
Open HL AI Functions →