Conversation
Codecov Report✅ All modified and coverable lines are covered by tests. Additional details and impacted files@@ Coverage Diff @@
## main #693 +/- ##
========================================
Coverage 97.21% 97.22%
========================================
Files 312 314 +2
Lines 40734 40877 +143
========================================
+ Hits 39600 39743 +143
Misses 1134 1134 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
Add vertex-assignment + edge-cut indicator ILP formulation (Chopra & Owen 1996) with kn+m binary variables and n+2km+k^2 constraints. Includes 6 unit tests (closed-loop, triangle, 2-terminal, extraction, solve_reduced), canonical example-db entry, paper documentation, and bib reference.
Implementation SummaryChanges
Deviations from Plan
Open Questions
|
Agentic Review ReportStructural Check
Build: Semantic Review — Mathematical Correctness:
Issue Compliance:
Issues:
Quality CheckDesign Principles:
Overhead Consistency: PASS — formulas verified against actual output Test Quality: 6 tests covering structure, closed-loop, triangle (k=3=n), 2-terminal (degenerate), manual extraction, solve_reduced. Missing: no test for objective coefficient structure (weights → ILP objective variable indices). Compare with Issues:
Overall: Good. Correct, well-commented, follows project conventions. Nothing blocks merge. Agentic Feature Tests
Issues found: None. Feature works end-to-end. Generated by review-pipeline |
Resolve conflicts in references.bib, rules/mod.rs, and examples.json. Regenerated fixtures with all rule examples. Co-Authored-By: Claude Opus 4.6 (1M context) <[email protected]>
Co-Authored-By: Claude Opus 4.6 (1M context) <[email protected]>
Summary
Add reduction rule from MinimumMultiwayCut to ILP using the standard vertex-assignment + edge-cut indicator formulation (Chopra & Owen 1996). The ILP uses kn + m binary variables and n + 2km constraints.
Fixes #185