1.

Algorithms: 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
Answer» D. Divide


Discussion

No Comment Found