From 7279e864dac5efcab7d8ca87b8b1e229a6517f3c Mon Sep 17 00:00:00 2001
From: Antti H S Laaksonen <ahslaaks@cs.helsinki.fi>
Date: Tue, 2 May 2017 17:50:35 +0300
Subject: [PATCH] Fix array name

---
 chapter13.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/chapter13.tex b/chapter13.tex
index 7afdbf3..746f79b 100644
--- a/chapter13.tex
+++ b/chapter13.tex
@@ -202,7 +202,7 @@ The algorithm consists of $n-1$ rounds,
 and on each round the algorithm goes through
 all edges of the graph and tries to
 reduce the distances.
-The algorithm constructs an array \texttt{distance}
+The algorithm constructs an array \texttt{dist}
 that will contain the distance from $x$
 to all nodes in the graph.
 The constant \texttt{INF} denotes an infinite distance.