One method to detect negative cycles can be to traverse the graph to find all the cycles and then add the edge weights in the cycles to see if any are negative. Will this method be faster than the Bellman Ford$$s algorithm $?$ NOTE: You only need to find whether there is a negative cycle or not. You do not need to find the shortest paths.