search

HarshCasper / NeoAlgo

Bringing all Data Structures and Algorithms under one Roof ⚡
MIT License
875 stars 1.05k forks source link

Travelling Salesman Problem (DP) #7505

Closed ishwari20 closed 3 years ago

ishwari20 commented 3 years ago

💥 Proposal

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?

Have you read the Contributing Guidelines on Pull Requests?

Yes

github-actions[bot] commented 3 years ago

Hello @ishwari20,
Thank you for opening an issue. :partying_face:
To get assigned to this particular issue please use /assign
Check this guide before contributing.

ishwari20 commented 3 years ago

/assign

github-actions[bot] commented 3 years ago

This issue has been assigned to @ishwari20! It will become unassigned if it isn't closed within 12 days. A maintainer can also add the pinned label to prevent it from being unassigned.