docs: document lazy all-pairs paths

[davidkpiano]

Summary:

• document the lazy and eager all-pairs shortest-path APIs
• clarify ordered-pair, tie, and early-exit behavior

Validation:

• graph hardening tests: 14 passed
• tracked Markdown links: passed
• git diff --check: passed

Summary by CodeRabbit

• Documentation
  • Documented a lazy all-pairs shortest-path generator alongside the existing eager approach.
  • Clarified that the generator supports early termination, while the eager method may produce large results.
  • Retained documentation covering negative-cycle handling in the Floyd–Warshall algorithm.

[coderabbitai]

Caution

Review failed

The pull request is closed.

ℹ️ Recent review info

⚙️ Run configuration

Configuration used: defaults

Review profile: CHILL

Plan: Pro Plus

Run ID: c16334b1-98f9-427f-80af-e3921a56b2fe

📥 Commits

Reviewing files that changed from the base of the PR and between e1ef7bc and be0792d.

📒 Files selected for processing (1)

• docs/algorithms.md

---

📝 Walkthrough

Walkthrough

The shortest-path documentation now includes genAllPairsShortestPaths, its early-exit behavior, and the existing eager getAllPairsShortestPaths API.

Changes

Shortest-path documentation

Layer / File(s)	Summary
Document lazy all-pairs generation docs/algorithms.md	Documents genAllPairsShortestPaths alongside getAllPairsShortestPaths and notes early-exit support.

Estimated code review effort: 1 (Trivial) | ~2 minutes

✨ Finishing Touches

🧪 Generate unit tests (beta)

• Create PR with unit tests
• Commit unit tests in branch codex/daily-docs-audit-2026-08-21

---

_{Comment @coderabbitai help to get the list of available commands.}

[devin-ai-integration]

✅ Devin Review: No Issues Found

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