leetcode
Bellman-Ford Algorithm
- Regular graph, graph has no cycle which means a vertex cannot go back the staring point
- Vertex directional graph
- Edge accepts positive and negative
“Bellman-Ford algorithm” is only applicable to “graphs” with no “negative weight cycles”.
Steps
- Make every vertexes in an array with infinity value
- Iterate a loop for n - 1 times where n means the number of vertexes.
Explanation
