engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Algorithms Algorithm Design Techniques Dynamic Programming
The Floyd-Warshall algorithm for all-pair shortest paths computation is based on
1
Greedy paradigm.
2
Divide-and-Conquer paradigm.
3
Dynamic Programming paradigm.
4
neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm.