mirror of
https://github.com/TheAlgorithms/C.git
synced 2026-02-04 05:44:35 +00:00
[FEATURE] Add Dijkstra's Algorithm with priority queue #207
Reference in New Issue
Block a user
Delete Branch "%!s()"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
Originally created by @Nihhaar0002 on GitHub (Nov 26, 2025).
Detailed description
Add Dijkstra's shortest path algorithm implementation using a min-heap priority queue for optimal O((V+E)logV) performance.
Context
This is a fundamental graph algorithm essential for competitive programming and real-world applications like GPS navigation.
Possible implementation
No response
Additional information
No response
@newstore56-sketch commented on GitHub (Dec 17, 2025):
Ccfdvf
@github-actions[bot] commented on GitHub (Jan 17, 2026):
This issue has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.
@github-actions[bot] commented on GitHub (Jan 24, 2026):
Please ping one of the maintainers once you add more information and updates here. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions!