Networks

NZ Level 7 (NZC) Level 2 (NCEA)

Distance optimisation

A few colleagues decided to carpool on the way to work. The following map displays the routes between their homes.

Starting from house $A$`A`, what is the shortest path that visits every house exactly once?

Represent the path by listing the vertices in order, separated by commas.

Easy

Approx 3 minutes

Sign up to try all questions

Choose appropriate networks to find optimal solutions

Apply network methods in solving problems