Single Source Shortest Path (SSSP) - Bellman Ford Algorithm

This video explains Bellman Ford Algorithm which helps finding Single Source Shortest Paths (SSSP) in directed graphs and undirected graphs and also helps detect if negative cycles are present in a directed graph. Code for this algorithm can be found here: https://github.com/abhiknowswhy/cp_and_algos/blob/main/Graph%20Algorithms/Medium/Single%20Source%20Shortest%20Path/Bellman%20Ford.md