New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

without returning to the start city? #2

Open

brmarkus opened this issue Nov 20, 2024 · 0 comments

brmarkus commented Nov 20, 2024

Isn't the tavelling salesman supposed to return to the start city?

From "https://en.wikipedia.org/wiki/Travelling_salesman_problem"

Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment