Refactor Dijkstra lazy: simplify, add docs and example#1301
Closed
williamfiset wants to merge 1 commit into
Closed
Refactor Dijkstra lazy: simplify, add docs and example#1301williamfiset wants to merge 1 commit into
williamfiset wants to merge 1 commit into
Conversation
- Remove Edge/Node classes, use int[] and double[] arrays instead - Remove custom Comparator field and EPS epsilon comparison - Use Double.compare lambda for PQ ordering - Add Javadoc with complexity, graph diagram, and main method - Make fields final, single-line bodies on new lines 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 join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Summary
EdgeandNodeclasses — useint[]for edges anddouble[]for PQ entriesComparatorfield, second constructor, andEPSepsilon comparisonDouble.comparelambda for PQ orderinggetGraph()andcreateEmptyGraph()helpersmainmethod with planar graph diagramTest plan
bazel build ...:graphtheorycompiles successfullybazel run ...:DijkstrasShortestPathAdjacencyListproduces correct shortest paths🤖 Generated with Claude Code