General Mathematics · Unit 4 · Graphs and networks · Planar graphs, paths and cycles

Solve practical problems to determine the shortest path between two vertices in a weighted graph (by trial-and-error methods only).

Practise this objective

AI-marked practice questions tied to QCAA mark schemes for this exact LO. Free to start.

Practice questions for this objective

Full questions, answers and worked solutions unlock when you start a free practice session.

Question 1

A delivery van must travel from Depot A to Warehouse D through a network of towns. The diagram shows the weighted graph with distances (in kilometres) along each route. Which path from Depot A to Warehouse D has the shortest total distance?

Worked answer

🔒 Start free to see full answer

Unlock all 1 answers — free

More in Planar graphs, paths and cycles

← Previous

Solve practical problems involving semi-Hamiltonian graphs and Hamiltonian graphs (by trial-and-error methods only). General Mathematics 2025 v1.3

Understand the meaning of Eulerian trail, semi-Eulerian graph, Eulerian circuit and Eulerian graph, and the conditions for their existence.

All LOs in Planar graphs, paths and cycles Back to full General Mathematics syllabus