Skip to content
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.

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

Create traveling_salesman.py #278

Merged
merged 5 commits into from
Oct 30, 2023
Merged

Create traveling_salesman.py #278

merged 5 commits into from
Oct 30, 2023

Conversation

AaryaNale
Copy link
Contributor

Added code

Description

The Traveling Salesman Problem (TSP) is a classic optimization challenge, where a salesperson seeks the shortest path to visit a set of cities once, returning to the starting point.

@AaryaNale
Copy link
Contributor Author

@kelvins Can you please review and suggest changes?

Copy link
Owner

@kelvins kelvins left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Hi @AaryaNale, thanks for the contrib, could you please fix the linter (CI) that is broken?

@AaryaNale AaryaNale requested a review from kelvins October 15, 2023 18:05
@AaryaNale
Copy link
Contributor Author

Fixed linter

Copy link
Owner

@kelvins kelvins left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Nice, thanks @AaryaNale 🎉

@kelvins kelvins merged commit 23c63ad into kelvins:main Oct 30, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants