Module tsp

Modules

brute_force

dp

This mod contains a recursive implementation of the TSP problem using dynamic programming. The main idea is that since we need to do all n! permutations of nodes to find the optimal solution that caching the results of sub paths can improve performance.