MCQOPTIONS
Bookmark
Saved Bookmarks
→
General Awareness
→
Banking Innovation in India in General Awareness
→
In the given graph, what is the minimum cost to tr..
1.
In the given graph, what is the minimum cost to travel from vertex 1 to vertex 3?
A.
3
B.
2
C.
10
D.
-3
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
In the given graph, how many intermediate vertices are required to travel from node a to node e at a minimum cost?
In the given graph, what is the minimum cost to travel from vertex 1 to vertex 3?
Floyd Warshall’s Algorithm can be applied on __________
Floyd Warshall’s Algorithm is used for solving ____________
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply