← Back to course topics

Algorithms on graphs II - Paper 3D: Decision Mathematics 1 — Edexcel A-Level Mathematics

Test yourself on Algorithms on graphs II - Paper 3D: Decision Mathematics 1 with PEARSON EDEXCEL A-Level practice questions.

7 days Premium · Then the free plan continues · No card, no charge

Your focus

3.1 Algorithm for finding the shortest route around a network, travelling along every edge at least once and ending at the start vertex (The Route Inspection Algorithm).

Algorithms on graphs II - Paper 3D: Decision Mathematics 1 exam tips

See every Edexcel A-Level Mathematics topic