Skip to content

feat: Add Dijkstra's Algorithm with priority queue #1538

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom
Open
joaovicenteft wants to merge 1 commit into
base: master
Choose a base branch
from
Open

feat: Add Dijkstra's Algorithm with priority queue #1538

joaovicenteft wants to merge 1 commit into from

Conversation

@joaovicenteft
Copy link

@joaovicenteft joaovicenteft commented Dec 2, 2025

Adds Dijkstra's algorithm using a min-heap priority queue as requested in #1537.

  • Graph: Adjacency list with weights.
  • PQ: Binary heap with insert/decrease simulation.
  • Example: 5-node graph, outputs shortest distances from node 0.

Tested with GCC; no memory leaks.

Fixes #1537.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Reviewers

@Panquesito7 Panquesito7 Awaiting requested review from Panquesito7 Panquesito7 is a code owner

@tjgurwara99 tjgurwara99 Awaiting requested review from tjgurwara99 tjgurwara99 is a code owner

@alexpantyukhin alexpantyukhin Awaiting requested review from alexpantyukhin alexpantyukhin is a code owner

At least 1 approving review is required to merge this pull request.

Assignees

No one assigned

Labels

None yet

Projects

None yet

Milestone

No milestone

Development

Successfully merging this pull request may close these issues.

[FEATURE] Add Dijkstra's Algorithm with priority queue

1 participant

@joaovicenteft