From 926dbdbf410718e447654e1c929d78f2e4c1bc54 Mon Sep 17 00:00:00 2001
From: Antti H S Laaksonen <ahslaaks@cs.helsinki.fi>
Date: Wed, 22 Feb 2017 21:36:36 +0200
Subject: [PATCH] Directed acyclic graphs are DAGs

---
 chapter16.tex | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/chapter16.tex b/chapter16.tex
index 605670a..f5e312d 100644
--- a/chapter16.tex
+++ b/chapter16.tex
@@ -5,7 +5,8 @@ In this chapter, we focus on two classes of directed graphs:
 \begin{itemize}
 \item \key{Acyclic graphs}:
 There are no cycles in the graph,
-so there is no path from any node to itself.
+so there is no path from any node to itself\footnote{Directed acyclic
+graphs are sometimes called DAGs.}.
 \item \key{Successor graphs}:
 The outdegree of each node is 1,
 so each node has a unique successor.