-
-
Notifications
You must be signed in to change notification settings - Fork 47k
Add Traveling Salesman Problem Algorithms And Tests #12820
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
base: master
Are you sure you want to change the base?
Add Traveling Salesman Problem Algorithms And Tests #12820
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Click here to look at the relevant links ⬇️
🔗 Relevant Links
Repository:
Python:
Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.
algorithms-keeper
commands and options
algorithms-keeper actions can be triggered by commenting on this PR:
@algorithms-keeper review
to trigger the checks for only added pull request files@algorithms-keeper review-all
to trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.
graphs/traveling_salesman_problem.py
Outdated
# Find the nearest city to the current location that has not been visited. | ||
next_city = min( | ||
((city, cost) for city, cost in enumerate(graph[current]) if not visited[city] and city != current), | ||
key=lambda x: x[1], |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Please provide descriptive name for the parameter: x
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
OK! Now I have solved this problem. I replaced the x with 'cost'.
graphs/traveling_salesman_problem.py
Outdated
return total_cost | ||
|
||
|
||
def test_tsp_example(): |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Please provide return type hint for the function: test_tsp_example
. If the function does not return a value, please provide the type hint as: def function() -> None:
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
OK! Now I have solved this problem. I added '-> None:' at the end of each function that does not return a parameter.
for more information, see https://pre-commit.ci
for more information, see https://pre-commit.ci
for more information, see https://pre-commit.ci
…thon into add-tsp-problem
for more information, see https://pre-commit.ci
…thon into add-tsp-problem
for more information, see https://pre-commit.ci
…thon into add-tsp-problem
for more information, see https://pre-commit.ci
Describe your change:
I solved the Open Issue #12128: Add TSP problem in Graph Data Structure.
This pull request implements the Traveling Salesman Problem (TSP) algorithms in the
graphs
module and tests in thegraphs/tests
module.tsp_brute_force
,tsp_dp
, andtsp_greedy
functions ingraphs/traveling_salesman_problem.py
.graphs/tests/test_traveling_salesman_problem.py
.Checklist: