1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question A Greedy No worries! We‘ve got your back. Try BYJU‘S free classes today! B Dynamic programming Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses C Backtracking No worries! We‘ve got your back. Try BYJU‘S free classes today! D Divide and Conquer No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution The correct option is B Dynamic programming
Bellman-Ford algorithm is used to find all pairs shortest distances in a graph and it is dynamic programming technique.
Similar questions View More
Join BYJU'S Learning Program
Related Videos
Plotting on a Graph
MATHEMATICS
Watch in App
Join BYJU'S Learning Program