From: Martin Mares <mj@ucw.cz>
Date: Wed, 16 Jan 2008 23:35:03 +0000 (+0100)
Subject: Summon phantoms.
X-Git-Tag: printed~297
X-Git-Url: http://mj.ucw.cz/gitweb/?a=commitdiff_plain;h=137b8cc9dde7ad1a4e6597a4d20aab1f669392ce;p=saga.git

Summon phantoms.
---

diff --git a/macros.tex b/macros.tex
index 6085f87..d75944d 100644
--- 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 51580d0..b75f344 100644
--- 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