Both will be correct.
S1. Bellman Ford works correctly if there are no negative weight cycles
S2. Floyd Warshall Algorithm uses Dynamic programming , therefore all the possiblities will be considered. So given that if shortest path exist(i.e., no negative weight cycles), then Floyd Warshall will surely find it.