0 votes 0 votes Which of the following algorithms solves the single-source shortest paths? Prim's algorithm Floys-Warshall algorithm Johnson's algorithm Dijkstra's algorithm DS ugcnetcse-july2018-paper2 data-structures graph-algorithm + – Pooja Khatri asked Jul 13, 2018 recategorized May 23, 2020 Pooja Khatri 2.6k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes Option D. Prim's algorithm = Min Cost spanning tree Floys-Warshall algorithm = All pair shortest path Johnson's algorithm = All pair shortest path Dijkstra's algorithm = Single source shortest path Remember : Bellman - Ford = Single source shortest path yuviabhi answered Aug 29, 2018 yuviabhi comment Share Follow See 1 comment See all 1 1 comment reply Shilpa lahot commented Oct 12, 2019 reply Follow Share Thanks it helps 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Option (4) Dijkstra's Algorithm solves single source shortest paths. shahidhope answered Jul 14, 2018 shahidhope comment Share Follow See all 0 reply Please log in or register to add a comment.