in Algorithms
131 views
1 vote
1 vote

Consider the following statements:
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’.
Which of the following statements are true?

i think all statement are correct ,we can use bfs to find shortest distance?

in Algorithms
131 views

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
3