Algorithm design technique to find all the pairs of shortest distances in a graph - Dynamic programming

Q.  Algorithms: From the following algorithm design techniques which one is used to find all the pairs of shortest distances in a graph?
- Published on 24 Jun 15

a. Backtracking
b. Greedy
c. Dynamic programming
d. Divide

ANSWER: Dynamic programming
 
The Bellman-Ford algorithm is used to find all the pairs of shortest distances in a graph.

Related Content

 

    Discussion

  • hashem   -Posted on 17 Mar 16
    good web

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲