NetLogo / NetLogo/NW-Extension
Add A* path finding algorithm
Open
Nobody has claimed this yet.
enhancement
- Dominant language
- Scala
- Stars
- 66
- Forks
- 25
- PR merge metrics
- No merged PRs in 30d
Description
This will really help for planar graphs. This is particular motivated by Arthur's massive road networks.
I'm planning on doing this, but leaving it unassigned for the moment.
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
No files, tests, or entry points are named in the issue. Start by locating the Network Extension's existing graph path-finding APIs and reviewing how planar or road networks are represented; done should mean A* path finding is available for those networks with appropriate verification.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- scala
- Domain
- networking
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100