NetLogo / NetLogo/NW-Extension
Dijkstra's algorithm doesn't accept negative edge weights
Open
Nobody has claimed this yet.
- Dominant language
- Scala
- Stars
- 66
- Forks
- 25
- PR merge metrics
- No merged PRs in 30d
Description
This would affect all the "weighted" versions of the link distance primitives. I'm not sure what the current behavior will be, but the primitives should probably check beforehand that all weights are positive numbers and give a meaningful error message if they aren't.
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
Start by locating the weighted link distance primitives and their Dijkstra implementation. Check the current behavior for negative edge weights, then define completion as consistent validation across the weighted primitives with a meaningful error for non-positive weights.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- scala
- Domain
- backend
- Issue type
- Bug
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100