diff --git a/chapter13.tex b/chapter13.tex
index f318a98..a3f3be4 100644
--- a/chapter13.tex
+++ b/chapter13.tex
@@ -38,7 +38,7 @@ \section{Bellman–Ford algorithm}
 The algorithm keeps track of distances
 from the starting node to all nodes of the graph.
 Initially, the distance to the starting node is 0
-and the distance to all other nodes in infinite.
+and the distance to all other nodes is infinite.
 The algorithm reduces the distances by finding
 edges that shorten the paths until it is not
 possible to reduce any distance.