fix: improve Dijkstra algorithm with proper min-heap implementation #781
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.
Description of Change
This PR significantly improves the Dijkstra algorithm implementation in
graph/dijkstra.go
by addressing several critical issues found in the current implementation:Problems Fixed:
interface{}
usage and unsafe castsImprovements Made:
container/heap
New Features Added:
DijkstraWithPath()
- Returns complete shortest path reconstructionDijkstraAllPairs()
- Computes distances to all reachable nodesPerformance & Quality:
Checklist
Notes: This improvement maintains 100% backward compatibility while fixing critical algorithmic and type safety issues. All existing code using
Dijkstra()
will continue to work unchanged, but with better performance and reliability.