v.net.salesman(1grass) on Linux
The text f4d2d06c64a8, as Debian 12 (Bookworm) 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