Bellman-Ford Algorithm is a dynamic programming problem that solves single-source shortest path.