[pull] master from williamfiset:master#129
Merged
pull[bot] merged 4 commits intoUncodedtech:masterfrom Mar 16, 2026
Merged
Conversation
…st (#1294) The adjacency matrix variant is redundant with BellmanFordEdgeList and BellmanFordAdjacencyList. Tests that used it as an oracle now use BellmanFordEdgeList instead. Co-authored-by: Claude Opus 4.6 <noreply@anthropic.com>
…1295) Redundant adjacency matrix variants — the adjacency list versions (LazyPrimsAdjacencyList, EagerPrimsAdjacencyList, TopologicalSortAdjacencyList) are more efficient and already cover the same algorithms. Co-authored-by: Claude Opus 4.6 <noreply@anthropic.com>
* Refactor BFS, remove FastQueue and Recursive duplicates Remove BreadthFirstSearchAdjacencyListIterativeFastQueue (custom IntQueue variant redundant with ArrayDeque) and BreadthFirstSearchRecursive (recursive BFS with queue-passing hack). Refactor the remaining BFS implementation with improved docs, final fields, and cleaner code style. Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com> * Rename BreadthFirstSearchAdjacencyListIterative to BreadthFirstSearchAdjacencyList Drop "Iterative" from the class and file name now that the recursive and fast-queue variants have been removed. Replace the 13-node example with a simpler 8-node graph including a visual diagram. Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com> * Remove cost from Edge class and simplify helpers for unweighted BFS BFS operates on unweighted graphs, so the cost field and weighted edge helpers are unnecessary. Rename addUnweightedUndirectedEdge to addUndirectedEdge. Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com> * Simplify reconstructPath: use LinkedList.addFirst to avoid reverse Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com> * Fix Integer reference comparison bug in reconstructPath Use intValue() instead of != to avoid reference comparison failure for node indices >= 128 (outside Integer cache range). Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com> --------- Co-authored-by: Claude Opus 4.6 <noreply@anthropic.com>
* Refactor BridgesAdjacencyList: add docs, clean up code Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com> * Change findBridges return type from flat List<Integer> to List<int[]> Each bridge is now returned as an int[2] pair instead of two consecutive elements in a flat list. Updated both test files accordingly. Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com> * Clarify findBridges Javadoc with concrete example Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com> * Document parallel-edge limitation in BridgesAdjacencyList Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com> * Remove BridgesAdjacencyListIterative and its test Redundant with the recursive BridgesAdjacencyList implementation. Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com> --------- Co-authored-by: Claude Opus 4.6 <noreply@anthropic.com>
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 subscribe to this conversation on GitHub.
Already have an account?
Sign in.
1 participant
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.
See Commits and Changes for more details.
Created by
pull[bot] (v2.0.0-alpha.4)
Can you help keep this open source service alive? 💖 Please sponsor : )