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

Java implementation of Bellman-Ford algorithm #63

Open
competitiveblood opened this issue Oct 9, 2023 · 4 comments
Open

Java implementation of Bellman-Ford algorithm #63

competitiveblood opened this issue Oct 9, 2023 · 4 comments
Assignees
@V-M-Tejus
Labels
Hacktoberfest-accepted

Comments

@competitiveblood
Copy link
Contributor

The Bellman-Ford algorithm is a single-source shortest path algorithm that can be used to find the shortest path from a single source vertex to all other vertices in a weighted directed graph.

It is capable of handling graphs with negative edge weights, which makes it more versatile than other shortest path algorithms, such as Dijkstra's algorithm.
@V-M-Tejus
Copy link

I would like to contribute here , can you assign this ?

@V-M-Tejus
Copy link

can you add up hacktoberfest labels to this , so that it adds up value to my contribution please

@competitiveblood
Copy link
Contributor Author

@tangorishi will assign to you

@tangorishi
Copy link
Owner

@V-M-Tejus go ahead

This was referenced Oct 11, 2023
Merged
Open
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@V-M-Tejus V-M-Tejus

Labels
Hacktoberfest-accepted
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
3 participants
@tangorishi @competitiveblood @V-M-Tejus