Skip to content

Refactor ArticulationPointsAdjacencyList with docs and comments#1286

Merged
williamfiset merged 1 commit into
masterfrom
refactor-articulation-points
Mar 13, 2026
Merged

Refactor ArticulationPointsAdjacencyList with docs and comments#1286
williamfiset merged 1 commit into
masterfrom
refactor-articulation-points

Conversation

@williamfiset

Copy link
Copy Markdown
Owner

Summary

  • Added comprehensive class-level Javadoc explaining Tarjan's algorithm, the articulation point condition (ids[u] <= low[v]), root node rule, and O(V+E) / O(V) complexity
  • Added inline comments in DFS explaining disconnected component handling, subtree disconnection condition, and back edge low-link updates
  • Added ASCII graph diagrams for both test examples showing articulation points visually
  • Made n and graph fields final, changed Integer to int in DFS loop
  • Cross-referenced BridgesAdjacencyList via @link

Test plan

  • All 11 existing ArticulationPointsAdjacencyListTest tests pass

🤖 Generated with Claude Code

…ph diagrams

Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>
@williamfiset
williamfiset merged commit e8511ed into master Mar 13, 2026
2 checks passed
@williamfiset
williamfiset deleted the refactor-articulation-points branch March 13, 2026 00:24
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