Flow Problem on Data Structure and Algorithms related Questions and Answers


Question :   What is the running time of an unweighted shortest path algorithm whose augmenting path is the path with the least number of edges?
1. O(|E|)
2. O(|E||V|)
3. O(|E|2|V|)
4. O(|E| log |V|)
5.
Answer :   3 - O(|E|2|V|)  

* 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