v.net.salesman(1grass) on Linux
The text f87a42113961, as Debian 9 (Stretch) 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