Repository navigation
fix(dsa): handle graph and integer boundaries - #4
Merged
Merged
Conversation
Bound C graph path reconstruction and reject unrepresentable graph results. Correct self-loop counts and integer-safe searching. Use an indexed heap for TypeScript graph paths and update regression coverage and documentation for the revised contracts.
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.
Summary
Verification
gofmt,go vet ./...,go test -race ./...passed../gradlew testpassed on JDK 17 and 21 (1,083 tests each).bun run typecheckandbun testpassed (1,704 tests).git diff --checkpassed.The GitHub Actions matrix also covers Python and Rust, which were not changed in this patch.