Computer Sciences > GATE 2026 SET-2 > Algorithms
Let πΊ be a weighted directed acyclic graph with π edges and π vertices. Given πΊ
and a source vertex π in πΊ, which one of the following options gives the worst case
time complexity of the fastest algorithm to find the lengths of shortest paths from π
to all vertices that are reachable from π in πΊ?
Correct : a
Similar Questions
Match the following
(P) Primβs algorithm for minimum spanning tree
(i) Backtracking
(Q) Floyd-Warshall algorithm fo...
Consider the following table
Algorithms
Design Paradigms
(P) Kruskal
(i) Divide and Conquer...
Consider functions Function 1 and Function 2 expressed in pseudocode as follows:
Let f1(n) and f2(n) denote the number of times the statement "x = x + 1" is...
Total Unique Visitors
Loading......