Traveling Salesperson Problem: TSP is a problem that tries to find a tour of minimum cost that visits every city once. In this visualization, it is assumed that the underlying graph is a complete graph with (near-)metric distance (meaning the distance function satisfies the triangle inequality) by taking the distance of two points and round it to the nearest integer.
View the visualisation of TSP algorithm here.
Originally, all edges in the input graph are colored with the grey.
Throughout the visualization, traversed edge will be highlighted with orange.