Skip to content
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

Dijkstra's algorithm #5174

Open
atumat opened this issue Aug 16, 2023 · 2 comments
Open

Dijkstra's algorithm #5174

atumat opened this issue Aug 16, 2023 · 2 comments

Comments

@atumat
Copy link
Contributor

atumat commented Aug 16, 2023

Describe the project you want to add with tech stack
Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a weighted graph.
Tech Stack : C

Expected behavior

A graph and source vertex are requirements for Dijkstra's Algorithm. This Algorithm is established on Greedy Approach and thus finds the locally optimal choice (local minima in this case) at each step of the Algorithm.
@atumat
Copy link
Contributor Author

atumat commented Aug 16, 2023

@pranjay-poddar @MohitGupta121 @TusharKesarwani please assign me this issue.

@atumat
Copy link
Contributor Author

atumat commented Aug 21, 2023

@pranjay-poddar Please assign me this issue. Thanks

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@atumat