9,306 views

2 Answers

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
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.

Related questions

3 votes
3 votes
2 answers
1
dd asked Dec 6, 2016
2,604 views
Let P be a shortest path from some vertex s to some other vertex t in a directed graph. If the weight of each edge in the graph is increased by one, P will still be a sho...
1 votes
1 votes
3 answers
2
1 votes
1 votes
3 answers
3
Rakesh K asked Nov 27, 2016
3,097 views
5 votes
5 votes
2 answers
4
jenny101 asked Oct 26, 2016
1,172 views