carta

v.net.salesman(1grass) on Linux

The text 87f8026ce28b, as Debian 7 (Wheezy) shipped it.

Creates a cycle connecting given nodes (Traveling salesman problem). Note that TSP is NP-hard, heuristic algorithm is used by this module and created cycle may be sub optimal

v.net.salesman(1grass) on Linux now