1.

Let G(V, E) be a directed graph where every edge has weight as either 1, 2 or 5, what is the algorithm used for the shortest path from a given source vertex to a given destination vertex to get the time complexity of O(V+E)?

A. BFS
B. DFS
C. Binary search
D. Radix sort
Answer» B. DFS


Discussion

No Comment Found