closed by
2,349 views
1 votes
1 votes
Consider following with respect to directed graph where there can be positive,negative edge weights but no negative edge cycle.

S1 : The Bellmann Ford algorithm will compute correctly the shortest path from source vertex S to every other Vertex.

S2 : The Floyd Warshall algorithm will compute correctly the shortest path between every pair of Verices.

Which of Following statements are Correct ?

A. Only S1

B. Only S2

C. Both

D. None
closed by

1 Answer

Related questions

0 votes
0 votes
2 answers
1
1 votes
1 votes
2 answers
2