v.net.salesman - Creates a cycle connecting given nodes (Traveling salesman problem).
v.net.salesman calculates the optimal route to visit nodes on a vector network.
Supported are cost assignments for arcs, and also different costs for both directions of a vector line. For areas, costs will be calculated along boundary lines.
Arcs can be closed using cost = -1.
east double precision, north double precision, label varchar(43)"
v.db.addtable myroads_net_time layer=3 col="cat integer,label varchar(43),length double precision,speed double precision,cost double precision"