Repository navigation
perf(exec): serial disposition for maximum_spanning_tree (#580) - #678
Merged
DecisionNerd merged 7 commits intoAug 12, 2026
Merged
Conversation
WalkthroughAdded deterministic maximum-spanning-tree analysis coverage to the M4 baseline and entry matrix. The workload compares repeated results, fingerprints output, records timing and RSS, and documents serial union-find execution. ChangesMaximum-spanning-tree M4 coverage
Estimated code review effort: 3 (Moderate) | ~20 minutes Possibly related issues
Possibly related PRs
Suggested labels: 🚥 Pre-merge checks | ✅ 3 | ❌ 2❌ Failed checks (1 warning, 1 inconclusive)
✅ Passed checks (3 passed)
✨ Finishing Touches📝 Generate docstrings
🧪 Generate unit tests (beta)
Comment |
DecisionNerd
force-pushed
the
cursor/580-serial-maximum-spanning-tree-disposition-c6a4
branch
from
August 11, 2026 23:04
7b5adf4 to
a9ae051
Compare
DecisionNerd
marked this pull request as ready for review
August 11, 2026 23:06
DecisionNerd
force-pushed
the
cursor/580-serial-maximum-spanning-tree-disposition-c6a4
branch
2 times, most recently
from
August 12, 2026 01:09
bdb3498 to
4ead674
Compare
There was a problem hiding this comment.
Actionable comments posted: 2
🤖 Prompt for all review comments with AI agents
Verify each finding against current code. Fix only still-valid issues, skip the
rest with a brief reason, keep changes minimal, and validate.
Inline comments:
In `@crates/graphforge-api/tests/m4_entry_baseline.rs`:
- Around line 606-620: Replace the hard-coded execution fields in the baseline’s
structural evidence with values observed from the GraphForge::analyze algorithm
path. Instrument or expose assertions for the actual thread policy, CSR
projection, and bounded Arrow sink behavior, and populate threads_path,
csr_native_projection, and bounded_arrow_sink from those observations rather
than constants.
- Around line 593-603: Add a fixture-specific correctness assertion in the
maximum_spanning_tree test before constructing WorkloadEvidence, validating the
expected selected edge endpoints and weights (or comparing against the approved
fixture fingerprint). Keep the existing assert_logical_batch_equal check to
preserve determinism coverage.
🪄 Autofix
Fix all unresolved CodeRabbit comments on this PR:
- Push a commit to this branch (recommended)
- Create a new PR with the fixes
ℹ️ Review info
⚙️ Run configuration
Configuration used: Path: .coderabbit.yaml
Review profile: CHILL
Plan: Pro
Run ID: 6fc9c8ef-17fb-46db-b3f7-7388c025273b
⛔ Files ignored due to path filters (1)
docs/development/execution-resource-policy.mdis excluded by!**/*.md,!**/docs/**
📒 Files selected for processing (4)
crates/graphforge-api/tests/m4_entry_baseline.rscrates/graphforge-exec/src/algorithm_analyze_minimum_spanning_forest.rsscripts/ci/m4-entry-matrix.pytests/contracts/m4-entry-matrix.json
This comment has been minimized.
This comment has been minimized.
DecisionNerd
force-pushed
the
cursor/580-serial-maximum-spanning-tree-disposition-c6a4
branch
2 times, most recently
from
August 12, 2026 01:50
16bca2c to
b8419b8
Compare
DecisionNerd
force-pushed
the
cursor/580-serial-maximum-spanning-tree-disposition-c6a4
branch
from
August 12, 2026 02:14
b8419b8 to
1274921
Compare
This comment has been minimized.
This comment has been minimized.
DecisionNerd
force-pushed
the
cursor/580-serial-maximum-spanning-tree-disposition-c6a4
branch
5 times, most recently
from
August 12, 2026 03:07
4486466 to
19fcd01
Compare
This comment has been minimized.
This comment has been minimized.
Closes #580 Co-authored-by: David Spencer <DecisionNerd@users.noreply.github.com>
Co-authored-by: Cursor <cursoragent@cursor.com>
Co-authored-by: Cursor <cursoragent@cursor.com>
Co-authored-by: Cursor <cursoragent@cursor.com>
Co-authored-by: Cursor <cursoragent@cursor.com>
Co-authored-by: Cursor <cursoragent@cursor.com>
Co-authored-by: Cursor <cursoragent@cursor.com>
DecisionNerd
force-pushed
the
cursor/580-serial-maximum-spanning-tree-disposition-c6a4
branch
from
August 12, 2026 03:18
6e52567 to
ceb8dc4
Compare
DecisionNerd
deleted the
cursor/580-serial-maximum-spanning-tree-disposition-c6a4
branch
August 12, 2026 03:26
This was referenced Aug 13, 2026
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.
Implements #580: serial disposition for maximum_spanning_tree.
Closes #580
Need help on this PR? Tag
@codesmith-botwith what you need. Autofix is disabled.Note
Add serial disposition for
analyze(by=MaximumSpanningTree)with test coverageserial_kruskal_descending_union_findas the fixed disposition forGraphForge::analyzewithMaximumSpanningTree, with no parallel crossover regardless ofcompute_threads.run_analyze_maximum_spanning_treetest helper that exercises the analyze call, checks determinism across two invocations, and recordsWorkloadEvidencewith the new disposition.analyze-maximum-spanning-treeworkload and validate it against structural gates.Macroscope summarized ceb8dc4.
Summary by CodeRabbit
Tests
Documentation