CodingTrain / CodingTrain/Suggestion-Box
Travelling salesman with a twist
Aperta
- Lingua principale
- Nessun dato sulla lingua
- Stelle
- 570
- Fork
- 85
- Metriche di merge delle PR
- Nessuna PR unita negli ultimi 30g
Descrizione
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.
Guida per i contributori
Nessuna guida per i contributori indicizzata per questo repository
Valutazione
Questa issue non è ancora stata valutata.