\section{Ranking phase}
-We start with $\allpatches = \{ \}$. We repeat
-{\bf Rank-Recurse}($\pc_0$) until $\allpatches$ is unchanged.
+{\bf Ranking} is:
+\begin{enumerate}
+\item Set $\allpatches = \{ \}$.
+\item Repeatedly:
+\begin{enumerate}
+\item Clear out the graph $\hasdirdep$ so it has neither nodes nor edges.
+\item Execute {\bf Rank-Recurse}($\pc_0$) .
+\item Until $\allpatches$ remains unchanged.
+\end{enumerate}
+\end{enumerate}
{\bf Rank-Recurse}($\pc$) is:
\begin{enumerate}
-\item foo
-\item bar
+\item Add $\pc$ to $\allpatches$ if it is not there already.
+\item Let $\set S_{\pcn} = h(\pcn)
+ \cup \{ \baseof{E} \; | \; \pendsof{ \left[
+ \bigcup_{\p \in \allpatches} h(\pn) \cup h(\py)
+ \right]
+ }{ \pcy } \} $
\end{enumerate}
\section{Planning phase}