Search topics

Search
1 of 8 0-day streak

Classify a route: walk, trail, path, circuit or cycle

DIFFICULTYintrostandardchallengeexam
QUESTION TYPEMix of allChange
classify each; path; compactclassify each; path; balancedclassify each; trail not path; compactclassify each; trail not path; balancedNOWMix of allRecommended
Question 1 of 8

No calculator

Use the unweighted network below. Vertices are named intersections, and edges are street sections between them

Unweighted network with no loops or parallel edges. Vertices in listed order: [High | Dover | Elm | Cedar]. Full edge list: Dover–Elm; High–Dover; Elm–Cedar; Dover–Cedar; High–Cedar.HighDoverElmCedar
1 mark

Classify the sequence High–Dover–Cedar–Elm–Dover