TSP
-optimal solution obtained using brute force solution.
-approximate solution obtained using nearest neighbour approach.
Warshall
-generated the transitive closure of a given directed boolean graph using dynamic programming
Floyd
-generated shortest path for all pairs in a weighted directed graph using dynamic programming