Te reo Māori terms
click each term to open in Te Aka
Learning objective overview
Master Teaching Guide coverage for this objective.
Current NZC (2007)
- No direct alignment recorded
New NZC (2026)
NZC26-P4-PRO-ETP-K-Y9-04
Resources
Terminology
- Hamiltonian path
- Hamiltonian circuit
- Vertex
- Edge
- Weighted network
- Nearest-neighbour strategy
- Optimal circuit
- Route inspection
Task goals
- Foundation: Identify whether a given route through a small network visits every vertex exactly once, distinguishing a Hamiltonian path from a Hamiltonian circuit.
- Proficient: Find and list Hamiltonian circuits in a weighted network and calculate the total weight (cost/distance/time) of a given circuit.
- Excellence: Determine the optimal (minimum-weight) Hamiltonian circuit for a network using systematic trial or a nearest-neighbour-style strategy, justifying that no shorter circuit exists.
Where this fits
What leads into this objective, and where it goes next.
You are here
Hamiltonian Circuits and Paths in Networks
Next
No further statements exist yet for the next step on this topic in the data.
For teachers
Need the fuller teaching notes for this objective? Open the Teacher guidance PDF.