The Bellman-Ford Algorithm to find the shortest path from a vertex s to all other vertices in a weighted graph G=(V,E) (check all that apply) can detect the presence of negative cycles. only works when the input graph is connected. only works if all weights are non-negative numbers. has running time equal to O(VE)