Skip to content

[pull] master from williamfiset:master#131

Merged
pull[bot] merged 1 commit intoUncodedtech:masterfrom
williamfiset:master
Mar 18, 2026
Merged

[pull] master from williamfiset:master#131
pull[bot] merged 1 commit intoUncodedtech:masterfrom
williamfiset:master

Conversation

@pull
Copy link

@pull pull bot commented Mar 18, 2026

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 : )

#1302)

* Refactor DijkstrasShortestPathAdjacencyList: remove Comparator, simplify

Replace the Comparator field and constructor with Comparable on Node,
simplify reconstructPath to use LinkedList.addFirst instead of reverse,
and unbox Integer loop variable to int.

Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>

* Remove PQ initial capacity, add test coverage for Dijkstra adjacency list

Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>

* Refactor Dijkstra adjacency list: clean up, simplify, apply style rules

Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>

* Refactor Dijkstra DHeap variant: clean up, simplify, apply style rules

Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>

* Add test coverage for DijkstrasShortestPathAdjacencyListWithDHeap

Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>

---------

Co-authored-by: Claude Opus 4.6 <noreply@anthropic.com>
@pull pull bot locked and limited conversation to collaborators Mar 18, 2026
@pull pull bot added the ⤵️ pull label Mar 18, 2026
@pull pull bot merged commit b71af5a into Uncodedtech:master Mar 18, 2026
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant