TheAlgorithms / TheAlgorithms/Dart
Travelling Salesman Problem implementation
Open
Nobody has claimed this yet.
- Dominant language
- Dart
- Stars
- 2.1k
- Forks
- 487
- PR merge metrics
- No merged PRs in 30d
Description
I am implementing a TSP algo in Dart and I have sent a PR to you under this Hacktoberfest 2023.
You can check the algo and merge the PR
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
The issue describes a Dart Travelling Salesman Problem implementation but names no file, entry point, or test. Start by locating the implementation referenced in the issue and checking the repository's existing algorithm conventions; done means the submitted implementation is complete, correct, and ready for review.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- dart
- Domain
- data
- Issue type
- Feature
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100