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

Euler tour technique

This commit is contained in:
Antti H S Laaksonen 2017-02-21 01:26:52 +02:00
parent 475c16c7e2
commit 2c6dd7134e
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
luku18.tex
View File

@ -87,7 +87,7 @@ as a sum where each term is a power of two.
\index{node array} \index{node array}
A \key{node array} contains the nodes of a rooted tree A \key{node array}\footnote{A similar idea is sometimes called the \key{Euler tour technique} \cite{tar84}.} contains the nodes of a rooted tree
in the order in which a depth-first search in the order in which a depth-first search
from the root node visits them. from the root node visits them.
For example, in the tree For example, in the tree