Add Bellman Ford Algorithm in C++ #146
Open
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Given a weighted, directed, and connected graph of V vertices and E edges, Find the shortest distance of all the vertices from the source vertex S. If vertices can't be reached from the S then mark the distance as 10^8. Note: If the Graph contains a negative cycle then return an array consisting of only -1.
codewithdev
reviewed
Oct 8, 2023
| @@ -0,0 +1,68 @@ | |||
| // Distance from the Source (Bellman-Ford Algorithm) | |||
There was a problem hiding this comment.
Can you add a quick introductory sentence above this explaining what this algorithm is before jumping to the solution?
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Given a weighted, directed, and connected graph of V vertices and E edges, Find the shortest distance of all the vertices from the source vertex S. If vertices can't be reached from the S then mark the distance as 10^8. Note: If the Graph contains a negative cycle then return an array consisting of only -1.
Please review and accept the PR for issue #140.
Thank you !! :)