Given a list of cities numbered from 0 to N-1 and a matrix “distances” consisting of N rows and N columns denoting the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the starting city?
Checklist
[x] I've read the contribution guidelines.
[x] I've checked the issue list before deciding what to submit.
[x] I've edited the README.md and link to my code.
Have you read the Contributing Guidelines on Pull Requests?
Yes
Description
Given a list of cities numbered from 0 to N-1 and a matrix “distances” consisting of N rows and N columns denoting the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the starting city?
Checklist
README.mdand link to my code.Related Issues or Pull Requests
Issue #7505