1
[PHP]Help with travelling salesman problem
Author Summary
alexgotyou is
in
PHP
Post Body
On a website that I'm working on, I'm going to get supplied a set of nodes, and I will need to find the shortest route where I get to every single node at least once.
However this deviates from the travelling salesman problem(TSP) in that TSP requires you to hit all nodes EXACTLY once, this is not a requirement in this case.
Will this slightly less restrictive definition change the difficulty of the algorithm needed in any significant way?
Additionally, if this is indeed a different problem, how would I go about solving it?
Author
Account Strength
90%
Account Age
12 years
Verified Email
Yes
Verified Flair
No
Total Karma
2,560
Link Karma
309
Comment Karma
2,251
Profile updated: 6 days ago
Posts updated: 10 months ago
Subreddit
Post Details
Location
We try to extract some basic information from the post title. This is not
always successful or accurate, please use your best judgement and compare
these values to the post title and body for confirmation.
- Posted
- 11 years ago
- Reddit URL
- View post on reddit.com
- External URL
- reddit.com/r/learnprogra...