Closed walk ($v_m=v_0$)

A walk in a graph whose first and last vertices agree. An Euclidean travelling salesman tour can be estimated by first constructing a closed walk visiting all locations and then using the triangle inequality to shortcut repeated visits.