Shortest Path Algorithms

Dijkstra’s algorithm: Greedy

http://www.geeksforgeeks.org/greedy-algorithms-set-6-dijkstras-shortest-path-algorithm/
Bellman Ford Algorithm: Dynamic Programming
Given a graph and a source vertex src in graph, find shortest paths from src to all vertices in the given graph. The graph may contain negative weight edges.

http://www.geeksforgeeks.org/dynamic-programming-set-23-bellman-ford-algorithm/