Warshall’s Algorithm: Computing the transitive closure of a directed graph using a Dynamic Programming method.

Floyd’s Algorithm: Solves the All Pairs Shortest Path problem of a edge weighted directed Graph using Dynamic Programming.