4 votes 4 votes Algorithm which solves the all pair shortest path problem is A)Dijkstra's algorithm B)Floyd's algorith C)Prim's algorithmm D)Warshall's algorithm DS graph-algorithms graph-theory + – vivekpinto07 asked Jun 24, 2016 vivekpinto07 9.3k views answer comment Share Follow See 1 comment See all 1 1 comment reply CSHuB commented Jan 25, 2020 reply Follow Share http://lcm.csa.iisc.ernet.in/dsa/node164.html 0 votes 0 votes Please log in or register to add a comment.
5 votes 5 votes A)Dijkstra->>Single Source Shortest Path C) Prims->>To obtain Minimum Spanning Tree B&D) Floyd-Warshall Algo->>All pair Shortest path Robert Floyd & Stephen Warshall two scientist :-from there name a single dynamic algorithm Floyd-Warshall...(Note:-they are not 2 different algorithms.. So, they should not given in two options) https://en.m.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm Rajesh Pradhan answered Jun 24, 2016 Rajesh Pradhan comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes you give options wrong because floyd's and warshall's are not two different algorithms . floyd-warshall algorithm is used to find the all pair shortest path problem. Nagamani answered Feb 6, 2018 Nagamani comment Share Follow See all 0 reply Please log in or register to add a comment.