Question

From the following algorithm design techniques which one

is used to find all the pairs of shortest distances in a graph?

A Backtracking

B Greedy

C Dynamic programming

D Divide

E Any of the above

Practice Next

More IT Networking Questions

Solution