in reply to
If you just want a "decent" path quickly, use an algorithm that starts with a minimum spanning tree, e.g. the
. A Graph::* module may or may not be useful for this.
Re: Travelling problem
Seekers of Perl Wisdom