https://github.com/vidiptvashist/travelling-salesman-problem

https://github.com/vidiptvashist/travelling-salesman-problem

Last synced: 3 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/vidiptvashist/travelling-salesman-problem
• Owner: vidiptvashist
• Created: 2022-07-24T14:15:09.000Z (over 2 years ago)
• Default Branch: main
• Last Pushed: 2022-07-24T17:00:34.000Z (over 2 years ago)
• Last Synced: 2024-11-13T23:30:36.410Z (2 months ago)
• Language: C++
• Size: 3.13 MB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Travelling-Salesman-Problem

A traveling salesman wishes to go to a certain number of destinations in

order to sell objects. He wants to travel to each destination exactly once and

return home taking the shortest total route.

Each voyage can be represented as a graph G = (V,E) where each destination,

including his home, is a vertex, and if there is a direct route that connects

two distinct destinations then there is an edge between those two vertices.

The traveling salesman problem is solved if there exists a shortest route that

visits each destination once and permits the salesman to return home