edited by
862 views
2 votes
2 votes

S1  : We might prefer Floyd-Warshall to Bellman-Ford when we want to find shortest path between all pair of vertices.
S2  : We might prefer Bellman-Ford to Dijkstra’s algorithm when graph have negative edge weights.
S3  : We might prefer BFS to Dijkstra’s algorithm, when we want to find shortest path from specific vertex ‘s’ to any other vertex ‘t’.

edited by

Please log in or register to answer this question.

Related questions

1 votes
1 votes
2 answers
1
4 votes
4 votes
6 answers
2
hem chandra joshi asked Aug 10, 2017
13,563 views
1 votes
1 votes
1 answer
4
hem chandra joshi asked Jul 22, 2017
699 views
Which of the following addresses is used to deliver a message to the correct application program running on a host?(A) Port(B) IP(C) Logical(D) Physical