Ok.. I need major help on the TSP divide and conquer..
any suggestion on how to tackel this?
I successfully implemented a greedy algorithm, a dynamic programming algorithm.
Right now, I have this as a merge sort type of divide and conquer, but I don't know how to traverse back thought my array to decide what choices I made...
any suggestion on how to tackel this?
I successfully implemented a greedy algorithm, a dynamic programming algorithm.
Right now, I have this as a merge sort type of divide and conquer, but I don't know how to traverse back thought my array to decide what choices I made...
Facebook
Twitter