CodingTrain / CodingTrain/Suggestion-Box
Travelling salesman with a twist
Open
- Dominant language
- No language data
- Stars
- 570
- Forks
- 85
- PR merge metrics
- No merged PRs in 30d
Description
Let's say that you have salesmen(circles) and their customers(squares).
Salesmen need to come to every customer, but they can't cross paths.
Can you make a program that solves this problem with n number of salesmen and m number of customers.
Connect them with lines, but remember that the lines can't cross.
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.