BikeNetKit / BikeNetKit/GrowBikeNet

Retain shortest edges from multiedges during network import

Open
#213 1 comment 0 reactions 0 assignees View on GitHub
Dominant language
Python
Stars
7
Forks
4
Avg merge
4h 4m
Merged PRs (30d)
32

Description

Instead of assuming key 0 edges exist (which is often not the case), only retain the shortest edges as in osmnx.convert.to_digraph(), independent of the key.

Continuation of #209 #212

Contributor guide

Open the contributing guide

Research direction

Start by tracing the network-import entry point and compare its multiedge handling with osmnx.convert.to_digraph(), particularly the assumption about edge key 0. Confirm the import retains only the shortest edge for each relevant pair regardless of key, then run the existing import or network tests and verify cases without key 0.

Written by the indexing model from the issue text.

Assessment

Tech stack
python
Domain
data
Issue type
Bug
Difficulty
3/5
Estimated time
1-2 days
Activity status
Active
Clarity
Mostly clear
Newbie friendliness
68/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.