This image was acquired from
wikimedia. It was marked as Public Domain or CC0 and is free to use. To verify, go to the source and check the information there.
Keywords from Image Description:
Salesman. Given the distances between any two points what is the shortest route salesman can make from point visiting all points and returning to point This is the Travelling Salesman problem an NPHard problem in mathematics made this image to illustrate the traveling salesman problem put no restrictions on its use traveling salesman