DrawCode

Hamiltonian Path

NP-hard: visits each vertex exactly once; backtracking or DP on subsets for small n.

Browse free without an account. Sign in to save progress, sync likes, and open your canvas workspace.