Repository navigation
fix(vermeer): optimize triangle count and clustering coefficient - #377
Merged
imbajin merged 1 commit intoNov 5, 2026
Conversation
Replace hash-heavy triangle and clustering implementations with degree-oriented sorted intersections, retain 64-bit counts, and harden communication and defensive edge handling.
imbajin
force-pushed
the
fix/vermeer-triangle-oriented-intersection-20261105
branch
from
November 5, 2026 17:34
e8e7678 to
95f83dc
Compare
MrJs133
approved these changes
Nov 5, 2026
imbajin
changed the title
This file contains hidden or 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
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.
Uses degree-oriented adjacency and adaptive intersections to reduce triangle-count and clustering-coefficient overhead. Triangle counts use 64-bit output; existing INT property keys require migration to LONG. See the source PR for design, tests, and compatibility details: hugegraph#30