Benchmark counting triangles in a graph #421
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
By counting homomorphisms out of the triangle graph.
epatters
changed the title
epatters
force-pushed
the
benchmark-graph-homs
branch
from
f58b6d3
to
fbce3f7
Compare
These are effectively counting queries.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Benchmark counting triangles in a graph via
The third commit gives a 10-20x speed improvement to the homomorphism search method.
Both methods are much slower than LightGraph's dedicated procedure for counting triangles. That is not surprising given the big difference in generality between the algorithms. Still, I think that large performance improvements are on the table, particularly for the CSP algorithm which I suspect is much slower than it should be.