Home / MCQ Bank / Computer
Computer Graph Algorithms (Dfs, Bfs, Dijkstras, Etc) Difficulty: Medium

Regarding implementation of Depth First Search using stacks, what is the maximum distance between two nodes present in the stack? (considering each edge length 1)

Select the correct option to test your answer:

More Computer Questions

Which editor was provided for use with Access Basic? What is the name of special procedural signals that are used to indicate changes in communications protocol status? What is the best case for linear search? If math class had add property with get and set accessors, then which of the following statements will work correctly? What is the time complexity of the following recursive implementation used to find the sum of the first n natural numbers? #include<stdio.h> int recursive_sum(int n) { if(n == 0) return 0; return n + recursive_sum(n - 1); } int main() { int n = 5; int ans = recursive_sum(n); printf("%d",ans); return 0; }