topic badge
New Zealand
Level 7 - NCEA Level 2

Distance optimisation

Interactive practice questions

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
3min

A rock band is planning a tour across several cities. The following table represents the routes and distance between the cities at which they will be performing.

Easy
3min

A mailman was allocated an area to deliver the mail to. The following table represents the routes and times between the houses.

Easy
4min

A courier business has to make multiple pick-ups from several stores. The following map displays the routes between the stores.

Easy
1min
Sign up to access Practice Questions
Get full access to our content with a Mathspace account

Outcomes

M7-5

Choose appropriate networks to find optimal solutions

91260

Apply network methods in solving problems

What is Mathspace

About Mathspace