Reimplement local betweenness calculations via igraph, if needed

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

Nobody has claimed this yet.

Assessment

Difficulty
5/5
Estimated time
Over a week
Newbie friendliness
25/100
Issue type
Refactor
Clarity
Needs clarification
Activity status
Quiet
Tech stack
python
Domain
data, performance

Research direction

Start by locating the current NetworkX betweenness calculation and measure its accuracy with node sampling and its runtime. Compare those results with the stated need for an igraph implementation; the issue does not define an accuracy threshold, performance target, entry point, or test, so completion criteria need to be clarified first.

Written by the indexing model from the issue text.

Description

This is only necessary if the current nx implementation with node sampling leads to not negligible inaccuracies, or if needed for speed.

Dominant language
Jupyter Notebook
Stars
7
Forks
0
Avg merge
4m
Merged PRs (30d)
16

Contributor guide

Open the contributing guide

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.

More from BikeNetKit/FixBikeNet

All issues in BikeNetKit/FixBikeNet

Similar issues

More Data Engineering issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.