From e147ed24f934d56744b763821dd170bc852d6d46 Mon Sep 17 00:00:00 2001
From: Ian Jackson <ijackson@chiark.greenend.org.uk>
Date: Sat, 7 Jul 2012 18:15:57 +0100
Subject: [PATCH] wip traversal

---
 trav-alg.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/trav-alg.tex b/trav-alg.tex
index 3151ca4..8cbaa9a 100644
--- a/trav-alg.tex
+++ b/trav-alg.tex
@@ -66,7 +66,7 @@ In some order, perhaps interleaving the two kinds of merge:
 
 \begin{enumerate}
 
-\item For each $\pd \isdirdep \pc$, find a merge base
+\item For each $\hasdep$-maximal $\pd \isdirdep \pc$, find a merge base
 $M \le W,\; \le \tipdy$ and merge $\tipdy$ into $W$.
 That is, use $\alg{Merge}$ with $L = W,\; R = \tipdy$.
 (Dependency Merge.)
-- 
2.30.2