TSP DP Architecture

The Travelling Salesman Problem (TSP) finds the minimum cost Hamiltonian cycle visiting all nodes exactly once using dynamic programming with bitmasks in $O(2^N \cdot N^2)$ time.