Forums
New posts
Search forums
Members
Current visitors
Log in
Register
What's new
Search
Search
Search titles only
By:
New posts
Search forums
Menu
Log in
Register
Install the app
Install
Forums
Archive
Archive
Java
Distance normalized TSP algorithm
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Reply to thread
Message
[QUOTE="Joshua Cranmer, post: 3597570"] That doesn't quite solve the problem: if going to node A and node B have the same cost, what criteria should I use to choose between them? Patricia would probably be satisfied with an answer like "the latter you looked at" instead of saying "choose randomly". That doesn't work either. Make a larger graph containing two of these "traps" and you'll note that you can't start from both of them at the same time. I haven't tested it myself, but your solution gets around the problem by (essentially) stating "start in the central node of the subgraph", which can't work if there are two subgraphs like that. Define "match well with distance," please. In this example, the number, I suppose is 1/4. I'm pretty sure a graph matching my description comes out to be 0 under this scheme. [/QUOTE]
Verification
Post reply
Forums
Archive
Archive
Java
Distance normalized TSP algorithm
Top