# Traveling Salesperson¶

A traveling salesperson route is an ordering of the vertices in a complete weighted graph.

A traveling salesperson route of [2, 1, 0, 3].

 traveling_salesperson(G[, sampler, …]) Returns an approximate minimum traveling salesperson route. traveling_salesperson_qubo(G[, lagrange, weight]) Return the QUBO with ground states corresponding to a minimum TSP route.