Search topics

Search
1 of 8 0-day streak

Hamiltonian paths and cycles

DIFFICULTYintrostandardchallengeexam
QUESTION TYPEMix of allChange
path; not asked; compact pathpath; not asked; meshed pathNOWMix of allRecommended
Question 1 of 8

No calculator

Use this network showing roads between regional locations. Each labelled point represents a location, and each line represents a direct road

Unweighted network with no loops or parallel edges. Vertices in listed order: [Southbank | Crossing | Northvale | Basin | Junction]. Full edge list: Northvale–Basin; Basin–Southbank; Basin–Crossing; Junction–Southbank; Crossing–Southbank; Crossing–Northvale; Northvale–Southbank.SouthbankCrossingNorthvaleBasinJunction
(a)1 mark

Which listed route is a Hamiltonian path?

(b)1 mark

How many edges does the correct route use?