Hamiltonian Walks using Bitmask DP

Hamiltonian Walk is a common application of Bitmask DP. The problem is simple: Given a graph, find the shortest path that visits every vertex exactly once. We can solve this using: Bitmasking to st