NetLogo / NetLogo/NW-Extension

nw:weighted-path-to won't necessarily return correct links if there's multiple links between turtles

Open
#171 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Dominant language
Scala
Stars
66
Forks
25
PR merge metrics
No merged PRs in 30d

Description

The sequence of turtles will be correct, but currently, we pick random links that connect those turtles. This usually doesn't matter, but if more than one link connect two turtles (with different link breeds), we won't necessarily return the one with the smallest weight.

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

Start by locating the implementation and tests for nw:weighted-path-to. Reproduce a network with multiple links between the same turtles, using different link breeds and weights, then trace how the returned links are selected. Done means the turtle sequence remains correct and each link chosen has the smallest weight among links connecting its turtle pair.

Written by the indexing model from the issue text.

Assessment

Tech stack
scala
Domain
networking
Issue type
Bug
Difficulty
3/5
Estimated time
1-2 days
Activity status
Stale
Clarity
Mostly clear
Newbie friendliness
45/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.