Parallelization of Degree Centrality #98
Conversation
Schefflera-Arboricola
left a comment
There was a problem hiding this comment.
clossness_centrality is already implemented in PR #72 . Please don't duplicate the effort. Also, could you please clean up this PR and remove the changes outside the scope of this PR(i.e. parallel implementation of degree_centrality)? Please mark the PR "Ready for review" once it's ready.
|
Thanks for the clarification, @Schefflera-Arboricola. I apologize for the oversight. I wasn’t aware that closeness_centrality was already implemented in PR #72, so I’ll go ahead and remove those changes to avoid any duplication. I’ll also clean up this PR to ensure it strictly focuses on the parallel implementation of degree_centrality and make sure the tests reflect that. Once everything is updated, I’ll mark the PR as "Ready for review." Appreciate the clarification! |
c60ff28 to
72caca4
Compare
|
Hey @SKADE2303, is this PR being worked on currently? Let me know, thanks! |
|
closing due to inactivity-- feel free to re-open if/when you get the bandwidth to work on this in the future. Thanks! |
1. Degree Centrality Implementation
Distributes degree centrality computation across multiple workers:
2. Testing Framework
Tests verify correctness and performance across multiple graph configurations:
Future Improvements
Another idea would be to add an approximate version that samples paths instead of calculating every single shortest path - would be way faster for those huge graphs I was testing with. I'm also thinking it'd be really handy to implement an incremental update feature, so you don't waste time recalculating everything when your graph only changes slightly.