What approach is being followed in Floyd Warshall Algorithm?
(a) Greedy technique
(b) Dynamic Programming
(c) Linear Programming
(d) Backtracking
I got this question in semester exam.
I want to ask this question from Shortest Path in portion Shortest Path of Data Structures & Algorithms II