Repository navigation
fix(vermeer): bound cycle detection search state - #380
Merged
imbajin merged 3 commits intoNov 5, 2026
Merged
Conversation
Rebase the iterative bounded-cycle implementation onto the current master and retain the defensive regression cases from the alternative recursive fix.
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.
Corrects cycle-length boundaries and reduces bounded cycle-search allocation and communication overhead. Boolean output uses INT; existing TEXT property keys require migration. See the source PR for design, tests, and compatibility details: hugegraph#33
Visual overview
Conceptual example of incoming traversal and reusable per-partition search state.