We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
The question I have when looking at this problem, is if it is necessary to find the shortest path to get the length of the shortest path.. I know that the TSP is not np-complete. But I am wondering if this more limited problem is, at least, verifiable in p. (even if it isn't np-hard)
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Travelling Salesman in a Grid
You are viewing a single comment's thread. Return to all comments →
The question I have when looking at this problem, is if it is necessary to find the shortest path to get the length of the shortest path.. I know that the TSP is not np-complete. But I am wondering if this more limited problem is, at least, verifiable in p. (even if it isn't np-hard)