The purpose of this project is to look at The Travelling Salesman Problem. If a salesman has to visit a series of towns before returning back to base, what is the shortest route that can be taken? Obviously the shortest route will depend on the layout of the points and the distances between them.
-
Notifications
You must be signed in to change notification settings - Fork 0
mujahid-rahman/Travellingsalesman
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published