[FEATURE] Add Dijkstra's Algorithm with priority queue #205

Open
opened 2026-01-29 15:08:59 +00:00 by claunia · 0 comments
Owner

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

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_
claunia added the Staleenhancement labels 2026-01-29 15:08:59 +00:00
Sign in to join this conversation.
1 Participants
Notifications
Due Date
No due date set.
Dependencies

No dependencies set.

Reference: starred/C#205