MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Representation of a Point on Cartesian Plane

Which one of ...

Question

Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?

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.

Suggest Corrections

thumbs-up

2

Similar questions

Q. To find the shortest-path in a weighted graph or network, which of the following algorithm is not used?

Q. Floyed-Warshall algorithm utilizes_______ to solve the all-pairs shortest paths problem on a directed graph in _____time.

Q. Which of the following algorithms solves the all-pair shortest path problem ?

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

Q. Dijkstra's single source shortest path algorithm when run from vertex 'a' in the below graph, computes the corrects shortest path distance to

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Plotting on a Graph

MATHEMATICS

Watch in App

explore_more_icon

Explore more

Representation of a Point on Cartesian Plane

Standard IX Mathematics

Join BYJU'S Learning Program

CrossIcon