Travelling salesman, xkcd, and a month old reddit post.
From a reddit post I made a month ago.
There are n! paths in a graph of size n. I can find the optimal TSP solution in O(n^2 2^n) time. Therefore, it is possible to do better than examine every path to find a TSP solution ( Read more... )
There are n! paths in a graph of size n. I can find the optimal TSP solution in O(n^2 2^n) time. Therefore, it is possible to do better than examine every path to find a TSP solution ( Read more... )
Comments 2
Reply
Reply
Leave a comment