The algorithm can’t be used here because it will infinitely keep calculating shorter paths. Bellman-Ford works here because it relies on edge relaxation, where it calculates the sum of the vertex distance and the edge weight, and compares this to the vertex distance in order to find the shortest path. As such, a negative cycle is detected if there is further possible relaxation after V-1 iterations, where V is the number of vertices.