diff options
author | Marcin Chrzanowski <mc370754@students.mimuw.edu.pl> | 2021-10-14 16:47:44 +0200 |
---|---|---|
committer | Marcin Chrzanowski <mc370754@students.mimuw.edu.pl> | 2021-10-14 16:47:44 +0200 |
commit | 9bb4127beca9881a0e8c520d23e0cc7bee99ccd4 (patch) | |
tree | 464fee4397c8fda03d8b1202c272d3f8a4b84bb1 | |
parent | 19c3c46fe457534fe991d1c7ce29e6ecdb44370c (diff) |
index -> label
-rw-r--r-- | mgr.tex | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -602,7 +602,7 @@ Now when given a query $x$, $y$, we: We can detect the siutation of there not being a marked node between $x$ and $y$ during step \ref{hmd-algo-lookup} by checking if $\prefixtable[k]$ is smaller -than the pre-order index of $y$. If it isn't, then all the nodes on the path +than the pre-order label of $y$. If it isn't, then all the nodes on the path from $x$ to $y$ were unmarked (had higher values in the modified \prefixtable\ since values at indices corresponding to unmarked nodes are set to $\infty$), and $k$ will correspond to a marked node that's not on the path from $x$ to $y$ |