in reply to Travelling problem

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.