From: Martin Mares <mj@ucw.cz>
Date: Fri, 22 Feb 2008 17:31:13 +0000 (+0100)
Subject: Fixes of typography.
X-Git-Tag: printed~225
X-Git-Url: http://mj.ucw.cz/gitweb/?a=commitdiff_plain;h=80dd3d110c21c8fa80db044f410f94cbc08c634e;p=saga.git

Fixes of typography.
---

diff --git a/macros.tex b/macros.tex
index aab43d9..2cf737f 100644
--- a/macros.tex
+++ b/macros.tex
@@ -345,12 +345,13 @@
 \def\example{\proclaim{Example}}
 
 \def\label#1{{\sl (#1)\/}\enspace}
+\def\labelx#1{\label{#1}\hfil\break\kern 0pt}	% Eat spaces
 
-\def\thmn#1{\thm\label{#1}\hfil\break}
-\def\lemman#1{\lemma\label{#1}\hfil\break}
-\def\defnn#1{\defn\label{#1}\hfil\break}
+\def\thmn{\thm\labelx}
+\def\lemman{\lemma\labelx}
+\def\defnn{\defn\labelx}
 \def\algn{\alg\label}
-\def\notan#1{\nota\label{#1}\hfil\break}
+\def\notan{\nota\labelx}
 
 \def\proof{\noindent {\sl Proof.}\enspace}
 \def\proofsketch{\noindent {\sl Proof sketch.}\enspace}
diff --git a/mst.tex b/mst.tex
index 549a7ab..8eea862 100644
--- a/mst.tex
+++ b/mst.tex
@@ -228,7 +228,7 @@ Most MST algorithms can be described as special cases of the following procedure
 \:In the beginning, all edges are colored black.
 \:Apply rules as long as possible:
 \::Either pick a cut~$C$ such that its lightest edge is not blue \hfil\break and color this edge blue, \cmt{Blue rule}
-\::Or pick a cycle~$C$ such that its heaviest edge is not red \hfil\break and color this edge \rack{blue.}{red.} \cmt{Red rule}
+\::or pick a cycle~$C$ such that its heaviest edge is not red \hfil\break and color this edge \rack{blue.}{red.\hfil} \cmt{Red rule}
 \algout Minimum spanning tree of~$G$ consisting of edges colored blue.
 \endalgo