C-plus-plus-Algorithms icon indicating copy to clipboard operation
C-plus-plus-Algorithms copied to clipboard
verified publisher icon codewithdev

Add Bellman Ford Algorithm in C++

Open Amisha328 opened this issue 2 years ago • 0 comments

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 !! :)

Amisha328 avatar Oct 07 '23 09:10 Amisha328