bibin
/
cphb
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Directed acyclic graphs are DAGs

This commit is contained in:
Antti H S Laaksonen 2017-02-22 21:36:36 +02:00
parent 18577f9941
commit 926dbdbf41
1 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
chapter16.tex
View File

@ -5,7 +5,8 @@ In this chapter, we focus on two classes of directed graphs:
\begin{itemize} \begin{itemize}
\item \key{Acyclic graphs}: \item \key{Acyclic graphs}:
There are no cycles in the graph, 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}: \item \key{Successor graphs}:
The outdegree of each node is 1, The outdegree of each node is 1,
so each node has a unique successor. so each node has a unique successor.