diff --git a/src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordAdjacencyList.java b/src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordAdjacencyList.java
index 9fe18b61c..aa20bc705 100644
--- a/src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordAdjacencyList.java
+++ b/src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordAdjacencyList.java
@@ -54,7 +54,7 @@ public static double[] bellmanFord(List<Edge>[] graph, int V, int start) {
     dist[start] = 0;
 
     // For each vertex, apply relaxation for all the edges
-    for (int i = 0; i < V - 1; i++)
+    for (int i = 0; i <=V - 1; i++)
       for (List<Edge> edges : graph)
         for (Edge edge : edges)
           if (dist[edge.from] + edge.cost < dist[edge.to])
@@ -63,7 +63,6 @@ public static double[] bellmanFord(List<Edge>[] graph, int V, int start) {
     // Run algorithm a second time to detect which nodes are part
     // of a negative cycle. A negative cycle has occurred if we
     // can find a better path beyond the optimal solution.
-    for (int i = 0; i < V - 1; i++)
       for (List<Edge> edges : graph)
         for (Edge edge : edges)
           if (dist[edge.from] + edge.cost < dist[edge.to]) dist[edge.to] = Double.NEGATIVE_INFINITY;