wiz-icon
MyQuestionIcon
MyQuestionIcon
3
You visited us 3 times! Enjoying our articles? Unlock Full Access!
Question

The Floyd-Warshall algorithm for all-pair shortest paths computation is based on

A
Greedy paradigm
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
Dynamic Programming paradigm
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
C
Divide-and-conquer paradigm
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
Neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution

The correct option is B Dynamic Programming paradigm
Floyd Warshall algorithm for all pair shortest paths computation is based on dynamic programming paradigm.

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Similar Things
QUANTITATIVE APTITUDE
Watch in App
Join BYJU'S Learning Program
CrossIcon