carta

v.net.salesman(1grass) on Linux

The text 699171d467d0, as Debian 13 (Trixie) shipped it. The page shows this text now.

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