8
Metric No Repeat Traveling Salesman Problem
source link: https://visualgo.net/en/tsp?slide=1
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
Metric No Repeat Traveling Salesman Problem
slowfast
0123251325132513
slide 1 (10%)
Traveling salesman 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.
Remarks: By default, we show e-Lecture Mode for first time (or non logged-in) visitor.
Please login if you are a repeated visitor or register for an (optional) free account first.
X Esc
Next PgDn
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK