Skip to content

Harden graph algorithms and batch operations - #36

Merged
davidkpiano merged 1 commit into
mainfrom
feature/upstream-graph-hardening
Aug 20, 2026
Merged

Harden graph algorithms and batch operations#36
davidkpiano merged 1 commit into
mainfrom
feature/upstream-graph-hardening

Conversation

@davidkpiano

Copy link
Copy Markdown
Member

Summary

  • enforce finite weights, capacities, and accumulated costs across shortest paths, spanning trees, and flow
  • add getUnweightedDistances, isWeaklyConnected, and isStronglyConnected
  • make low-link connectivity iterative and stack-safe with multigraph/self-loop coverage
  • snapshot transform inputs and make iterable bulk deletion a single mutation pass
  • update public docs and add a minor changeset

Verification

  • pnpm verify
  • 83 test files, 1,880 tests passed

@davidkpiano
davidkpiano marked this pull request as ready for review August 20, 2026 19:09

@devin-ai-integration devin-ai-integration Bot left a comment

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

✅ Devin Review: No Issues Found

Devin Review analyzed this PR and found no bugs or issues to report.

Open in Devin Review

@davidkpiano
davidkpiano merged commit e1ef7bc into main Aug 20, 2026
6 checks passed
@github-actions github-actions Bot mentioned this pull request Aug 20, 2026
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant