williamfiset / williamfiset/algorithms
Add new test cases and correct old ones for TspDynamicProgrammingIterative
Nobody has claimed this yet.
- Dominant language
- Java
- Stars
- 18.8k
- Forks
- 4.5k
- PR merge metrics
- No merged PRs in 30d
Description
The class TspDynamicProgrammingIterative currently has 81% branch coverage and can be extended to have 100% coverage. There are no tests for checking too large distance matrices, and there are also some tests that incorrectly handle for example non-square distance matrices.
Contributor guide
No contributing guide indexed for this repository
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
Locate TspDynamicProgrammingIterative and its existing tests, then run the current test suite with branch coverage. Add cases for distance matrices that are too large and correct the tests for non-square matrices; done means the tests accurately reflect the intended behavior and branch coverage reaches 100%.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- java
- Domain
- testing
- Issue type
- Refactor
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 42/100