Improve graph algorithms and fix bugs#35
Merged
ecraig12345 merged 3 commits intomainfrom Feb 19, 2026
Merged
Conversation
ecraig12345
force-pushed
the
ecraig/graph-fixes
branch
2 times, most recently
from
e0f46f5 to
49cce5e
Compare
ecraig12345
force-pushed
the
ecraig/graph-fixes
branch
from
49cce5e to
637e562
Compare
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.
This PR improves the efficiency of the graph algorithms, adds test coverage, and fixes bugs in the priority queue ordering logic.
Core library improvements
PGraphfor greater efficiency, improved cycle detection, and support for both object and map node definitions.PriorityQueueimplementation to correctly maintain the heap property (ensuring correct removal order)PriorityQueueandgetNodeCumulativePrioritiesAPI and packaging
PGraphclass, and only export necessary typesDocumentation