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

Small fix

This commit is contained in:
Antti H S Laaksonen 2017-02-22 21:42:35 +02:00
parent 1948b232ae
commit 2784ffa5ee
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
chapter18.tex
View File

@ -689,9 +689,9 @@ using a depth-first search:
\end{tikzpicture} \end{tikzpicture}
\end{center} \end{center}
However, we use a bit different variant of
However, we use a bit different technique where the tree traversal array where
we add each node to the tree traversal array \emph{always} we add each node to the array \emph{always}
when the depth-first search visits the node, when the depth-first search visits the node,
and not only at the first visit. and not only at the first visit.
Hence, a node that has $k$ children appears $k+1$ times Hence, a node that has $k$ children appears $k+1$ times