What is a Hamiltonian Path?

Approach: Define a path that visits every vertex exactly once.

A path in an undirected or directed graph that visits each vertex exactly once.

Follow-up: How does it differ from an Euler path?

Key concepts: vertex visit, np-complete.