Shortest Path on Data Structure and Algorithms related Questions and Answers


Question :   In the given graphmcq on data structures algorithmsHow many intermediate vertices are required to travel from node a to node e at a minimum cost?
1. 2
2. 0
3. 1
4. 3
5.
Answer :   3 - 1  

* 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