search

easy-graph / Easy-Graph

EasyGraph is an open-source network analysis library designed to cover advanced network processing methods. It includes functionalities for detecting structural hole spanners, network embedding, and various classic network analysis techniques.
https://easy-graph.github.io/
BSD 3-Clause "New" or "Revised" License
400 stars 39 forks source link

Request to implement a feature about betweenness_centrality #135

Closed Gushaokui closed 3 weeks ago

Gushaokui commented 2 months ago

Hello, easygraph developers I found that the betweenness_centrality function does not implement the feature of sampling k nodes to calculate the node betweenness centrality. But networkx has implemented it. This is to reduce the calculation time of obtaining the node betweenness centrality when the graph is very large. By the way, networkx does not consider how to choose k to balance the calculation time and the node betweenness centrality close to the true value. I hope you can consider this. Thank you very much.

mgao97 commented 2 months ago

Thank you for your valuable suggestion!

We appreciate your insights regarding the betweenness_centrality function and the potential benefits of incorporating sampling for k nodes.

We will consider this feature for future versions.

github-actions[bot] commented 4 weeks ago

This issue is stale because it has been open 30 days with no activity. Remove stale label or comment or this will be closed in 5 days.

github-actions[bot] commented 3 weeks ago

This issue was closed because it has been stalled for 5 days with no activity.