5 votes 5 votes Which of the following algorithms solves the all pair shortest path problem? Prim's algorithm Dijkstra's algorithm Bellman ford algorithm Floyd warshalls algorithm Algorithms isro2017 algorithms graph-algorithms + – sh!va asked May 7, 2017 • reopened May 9, 2017 by Arjun sh!va 4.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 8 votes 8 votes Option D will be correct... Floyd warshalls algorithm is based on dynamic paradigm approach which is used to solve All pair shortest path problem.. akash.dinkar12 answered May 7, 2017 • selected May 9, 2017 by Arjun akash.dinkar12 comment Share Follow See all 0 reply Please log in or register to add a comment.
5 votes 5 votes Prim's algorithm-------> spanning Tree Dijkstra's algorithm------> single source shortest path Bellman ford algorithm-------> single source shortest path Floyd warshalls algorithm----->all pair shortest path so ans: D rishu_darkshadow answered Sep 16, 2017 rishu_darkshadow comment Share Follow See 1 comment See all 1 1 comment reply raja11sep commented Jun 22, 2021 reply Follow Share Minimum spanning tree 0 votes 0 votes Please log in or register to add a comment.
–1 votes –1 votes (d) has least complexity 0(v3) as solved by dynamic approach abhishek tiwary answered Jun 30, 2017 • edited Nov 13, 2017 by abhishek tiwary abhishek tiwary comment Share Follow See all 0 reply Please log in or register to add a comment.