0 votes 0 votes Single source shortest path problems can be implemented by greedy algorithms using A. Singly linked list B. Min heap C. AVL tree D. All of the above Algorithms greedy-algorithm + – Vaishnavi01 asked Sep 25, 2018 • edited Mar 11, 2019 by Naveen Kumar 3 Vaishnavi01 1.4k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply srestha commented Sep 25, 2018 reply Follow Share D)... 0 votes 0 votes Nishikant commented Oct 4, 2018 reply Follow Share As option is D) lets consider the efficient one , it will be done either by using Dijkstra or Bellman, as we know that Dijkstra is better (though it cant handle the negative weight cycle),so now in Dijkstra's we keep on choosing the node or vertex with minimum weight --->this operation can be mapped to the extract minimum operation of the min heap which takes O(logn) or O(logv) times and then we are relaxing the edges i.e O(Elogv)...so it is the best option we have. But the answer is D) :) 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes We can use all of the above for single source shortest path but efficiently it will be done by min-heap rajatmyname answered Sep 26, 2018 rajatmyname comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes option D) is correct ,We can use all of them for single source shortest path. Sanandan answered Sep 11, 2020 Sanandan comment Share Follow See all 0 reply Please log in or register to add a comment.