Bellman Ford Algorithm, Data Structure Algorithm, Algorithms, Weighted Graph, Graph Data Structure.
the source vertex to all other vertices as infinity. Now, traverse through every edge and relax them while doing so. Now, repeat the process for V-1 times. (where V — is the number of vertices) Run the process one more time, if the edges are being relaxed even after V-1 times then you could