Which one of the following algorithmic approaches is followed in Floyd-Warshall shortest path algorithm?
A. Divide and conquer
B. Dynamic programming
C. Greedy approach
D. Backtracking
Answer:B
Which one of the following algorithmic approaches is followed in Floyd-Warshall shortest path algorithm?
A. Divide and conquer B. Dynamic programming C. Greedy approach D. Backtracking