Euler tour technique
This commit is contained in:
parent
475c16c7e2
commit
2c6dd7134e
|
@ -87,7 +87,7 @@ as a sum where each term is a power of two.
|
|||
|
||||
\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
|
||||
from the root node visits them.
|
||||
For example, in the tree
|
||||
|
|
Loading…
Reference in New Issue