Fixing a minor bug in Undirected graph. TSP DP solution is fast using BitSets but run out of memory, using bitwise operations instead uses very low memory, but is suprisingly slow !!!!
Implementing Branch-and-Bound solution for TSP, correct and not that fast. Further optimizations are needed