diff --git a/src/algorithms/graph/bellman-ford/bellmanFord.js b/src/algorithms/graph/bellman-ford/bellmanFord.js
index 70e811d9..97b3f785 100644
--- a/src/algorithms/graph/bellman-ford/bellmanFord.js
+++ b/src/algorithms/graph/bellman-ford/bellmanFord.js
@@ -7,7 +7,7 @@ export default function bellmanFord(graph, startVertex) {
   const distances = {};
   const previousVertices = {};
 
-  // Init all distances with infinity assuming that currently we can't reach
+  // Init all distances with infinity assuming that currently we can't reach__
   // any of the vertices except start one.
   distances[startVertex.getKey()] = 0;
   graph.getAllVertices().forEach((vertex) => {