Graph Search on Data Structure and Algorithms related Questions and Answers


Question :   What will be the time complexity of the iterative depth first traversal code(V=no. of vertices E=no.of edges)?
1. O(V+E)
2. O(V)
3. O(E)
4. O(V*E)
5.
Answer :   1 - O(V+E)  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter