NetLogo / NetLogo/NW-Extension
There should be a way to get all the shortest paths of equal length
Open
Nobody has claimed this yet.
enhancement
- Dominant language
- Scala
- Stars
- 66
- Forks
- 25
- PR merge metrics
- No merged PRs in 30d
Description
Currently, all the "path-to" primitives return the first path that Jung's implementation of Dijktra's algorithm finds.
Maybe there should even be a way to get all the acyclic paths from A to B. (You could then order them by length if you want to.)
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 reviewing the path-to primitives and the use of Jung's Dijkstra implementation described in the issue. Clarify whether the goal is all equal-length shortest paths, all acyclic paths, or both; done means the selected behavior is defined and exposed consistently by the path-to primitives.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- scala
- Domain
- networking
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100