v.net.salesman(1grass) on Linux
The text b840e9d43466, as Debian 4.0 (Etch) shipped it.
Create 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.