Shortest Path on Data Structure and Algorithms related Questions and Answers


Question :   In the given graph:mcq on data structures algorithmsIdentify the shortest path having minimum cost to reach vertex E if A is the source vertex
1. a-b-e
2. a-c-e
3. a-c-d-e
4. a-c-d-b-e
5.
Answer :   2 - a-c-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