0w1

Entries from 2016-10-08 to 1 day

Classic Travelling Salesman Problem ( DP )

O( 2^N * N^2 ) Given a weighed graph, we are to find the minimum distance of starting from some node, travelling through each other node exactly once, and coming back to the start. Since that will form a cycle, we can start at any arbitrar…