In the given graph, identify the shortest path having minimum cost to reach vertex E if A is the source vertex.
(a) a-b-e
(b) a-c-e
(c) a-c-d-e
(d) a-c-d-b-e
The question was posed to me during an internship interview.
I'm obligated to ask this question of Shortest Path topic in portion Shortest Path of Data Structures & Algorithms II