Summon phantoms.

diff --git a/macros.tex b/macros.tex
index 6085f87c1adb0ab5ee4c6b6fde7971b1d243a261..d75944d9aa34c7e1c488240c14e1494e32b3c376 100644 (file)
--- a/macros.tex
+++ b/macros.tex
@@ -34,6 +34,7 @@
 \def\qed{{\parfillskip=0pt\allowbreak\hfill\nobreak $\spadesuit$\par}}
 \def\FIXME#1{\>{\bo FIXME:} #1}
 \def\symdiff{\mathbin{\Delta}}
+\def\hphantas#1#2{\setbox0=\hbox{#2}\hbox to \wd0{#1\hss}}
 
 % Footnotes
 \newcount\footcnt

diff --git a/mst.tex b/mst.tex
index 51580d064e38e3f274cbc6d8ddb4bd8140481a61..b75f34409d215ae23ed4fe7730359287a77a2a20 100644 (file)
--- a/mst.tex
+++ b/mst.tex
@@ -194,7 +194,7 @@ Most MST algorithms can be described as special cases of the following procedure
 \:In the beginning, all edges are colored black.
 \:While possible, use one of the following rules:
 \::Pick a cut~$C$ such that its lightest edge is not blue \hfil\break and color this edge blue. \cmt{Blue rule}
-\::Pick a cycle~$C$ such that its heaviest edge is not red \hfil\break and color this edge red. \cmt{Red rule}
+\::Pick a cycle~$C$ such that its heaviest edge is not red \hfil\break and color this edge \hphantas{red.}{blue.} \cmt{Red rule}
 \algout Minimum spanning tree of~$G$ consisting of edges colored blue.
 \endalgo