PN5
Hamiltonian Path
哈密顿路径
Path / 路径Grades G6 - G8
👀
What It Looks Like
Recognition signals — when you see these, think of this structure:
- 1Visiting all locations exactly once
- 2Knight's tour or similar puzzles
- 3Questions about whether such a path exists
🎯
What It Really Tests
The core mathematical idea behind this structure:
Find a path that visits every vertex exactly once.
找到恰好访问每个顶点一次的路径。
⚠️
Why Students Get Stuck
Common mistakes to watch out for:
- ⚠Confusing with Eulerian paths (visiting all edges)
- ⚠Not checking all possibilities before declaring impossible
- ⚠Revisiting vertices or missing some
💡
Your First Step
How to begin thinking about problems with this structure:
Try different starting points and systematically explore, backtracking when stuck.
尝试不同起点并系统探索，卡住时回溯。
Related Structures
These structures share similar patterns or thinking approaches: