in reply to Re: Graph Traversal
in thread Graph Traversal
This problem has one feature that make
is distinct from the classic TSP (Travelling
Salesman Problem). In the TSP you must visit every node
exactly once. Even if a node is very
far away it must be visited.
In my case I only need to visit
as many nodes as possible in so many moves and
can safely ignore nodes that are
"too far away".
I've tried adpoting spanning-tree approach to solving the TSP with moderate success. But I have already done better with an algorithm of my own.
|
---|
Replies are listed 'Best First'. | |
---|---|
Re: Graph Traversal
by tedv (Pilgrim) on Nov 08, 2000 at 23:46 UTC | |
by Albannach (Monsignor) on Nov 09, 2000 at 00:09 UTC |
In Section
Seekers of Perl Wisdom