-
-
Notifications
You must be signed in to change notification settings - Fork 392
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Cache friendly strength and degree #2602
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thank you, this is great work! Are you new to igraph, or have you used it before?
The two comments are just an FYI. I'll take care of these and will merge the PR.
If you'd like to be credited using your real name (in addition to your github handle), please let me know what it is.
Codecov ReportAttention: Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #2602 +/- ##
==========================================
- Coverage 84.33% 84.29% -0.04%
==========================================
Files 379 379
Lines 61908 61949 +41
Branches 12116 12137 +21
==========================================
+ Hits 52210 52221 +11
- Misses 9698 9728 +30
Continue to review full report in Codecov by Sentry.
|
I updated the benchmarks to compare the previous implementation (b) with this faster code path (a), and I'm getting the following:
|
Implements #2599. Specifically:
igraph_degree()
when ignoring loops and calculating degree for all vertices,igraph_strength()
when calculating strength for all vertices,igraph_strength()
.Local benchmark results
igraph_strength()
before:igraph_strength()
after:igraph_degree()
before:igraph_degree()
after: