From 9ca906ee77d54ed9da7e1ba52a1f76bbee8ea341 Mon Sep 17 00:00:00 2001
From: Antti H S Laaksonen <ahslaaks@cs.helsinki.fi>
Date: Wed, 19 Apr 2017 21:16:50 +0300
Subject: [PATCH] Change circuit -> path

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

diff --git a/chapter19.tex b/chapter19.tex
index 8e27242..6b00034 100644
--- a/chapter19.tex
+++ b/chapter19.tex
@@ -546,7 +546,7 @@ combinations of three bits:
 000, 001, 010, 011, 100, 101, 110 and 111.
 
 It turns out that each De Bruijn sequence
-corresponds to an Eulerian circuit in a graph.
+corresponds to an Eulerian path in a graph.
 The idea is to construct the graph so that
 each node contains a combination of $n-1$ characters
 and each edge adds one character to the string.