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 #205
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