Question

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

A Dynamic Programming
B Backtracking
C Greedy
D None of these
Practice Next

Relevant for Exams:

Hey! Ask a query