Traveling Salesman Algorithm Showcase of traveling salesman algorithm (not optimized for speed or memory). All nodes should be visited in the shortest path visible, startpoint '0' is fixed, numbering is based on order of being generated, location is random.