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