|
|
|
| Perl-Sensitive Sunglasses | |
| PerlMonks |
Re: Travelling problemby educated_foo (Vicar) |
| on Dec 21, 2013 at 01:59 UTC ( [id://1068009]=note: print w/replies, xml ) | Need Help?? |
|
If you just want a "decent" path quickly, use an algorithm that starts with a minimum spanning tree, e.g. the Christofides Algorithm. A Graph::* module may or may not be useful for this.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||