\newcommand{\iassign}{\leftarrow}
%\newcommand{\assign}{' =}
+\newcommand{\alg}[1]{\text{\bf #1}}
+
\newcommand{\eqntag}[2]{ #2 \tag*{\mbox{#1}} }
\newcommand{\eqn}[2]{ #2 \tag*{\mbox{\bf #1}} }
\item Repeatedly:
\begin{enumerate}
\item Clear out the graph $\hasdirdep$ so it has no edges.
-\item Execute {\bf Rank-Recurse}($\pc_0$)
+\item Execute $\alg{Rank-Recurse}(\pc_0)$
\item Until $\allpatches$ remains unchanged.
\end{enumerate}
\end{enumerate}
-{\bf Rank-Recurse}($\pc$) is:
+$\alg{Rank-Recurse}(\pc)$ is:
\begin{enumerate}
-\item If we have already done {\bf Rank-Recurse}($\pc$) in this
+\item If we have already done $\alg{Rank-Recurse}(\pc)$ in this
ranking iteration, do nothing. Otherwise:
\item Add $\pc$ to $\allpatches$ if it is not there already.
\item For each $i \ldots 1..n$, update our putative direct
dependencies:
$$
-\Gamma \assign \text{\bf set-merge}\left[\Gamma,
+\Gamma \assign \alg{set-merge}\left[\Gamma,
\left( \begin{cases}
M_i \in \pcn : & \depsreqof{M_i} \\
M_i \not\in \pcn : & \{ \}
\right]
$$
-TODO define {\bf set-merge}
+TODO define $\alg{set-merge}$
\item Finalise our putative direct dependencies
$
If this results in a cycle, abort entirely (as the function $g$ is
inappropriate; a different $g$ could work).
\end{enumerate}
-\item Run ${\text{\bf Rank-Recurse}}(\pd)$.
+\item Run $\alg{Rank-Recurse}(\pd)$.
\end{enumerate}