JuliaGraphs / JuliaGraphs/Graphs.jl

Edge Betweenness Centrality

Open
#78 1 comment 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

enhancement
Dominant language
Julia
Stars
538
Forks
128
Avg merge
10h 25m
Merged PRs (30d)
2

Description

At the moment, there is no function to calculate the edge betweenness centrality of a graph.

I have an implementation for undirected/unweighted graphs, at least.

Should I do a PR for this?

https://github.com/J-C-Q/Introduction-to-Network-Science/blob/0b83582a49e8833314fe8453b19643549d127d89/edge_betweenness_centrality.jl

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.

Research direction

Start by reading the linked edge_betweenness_centrality.jl implementation and compare its undirected, unweighted scope with the current Graphs.jl conventions. Clarify the target API and supported graph types before proceeding; done means an agreed implementation is integrated into Graphs.jl with coverage for its stated scope.

Written by the indexing model from the issue text.

Assessment

Tech stack
julia
Domain
data
Issue type
Feature
Difficulty
4/5
Estimated time
3-5 days
Activity status
Stale
Clarity
Mostly clear
Newbie friendliness
35/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.