Fixes of typography.

diff --git a/macros.tex b/macros.tex
index aab43d925d96851d6be4e4f5b1fe17eef83aa0d3..2cf737f445e6d43fefb55e6e4a0f2a1fb20b2445 100644 (file)
--- 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 549a7abc63a2e75cb314288dc55633a67450e283..8eea862c5ef2612e3ca7ce13d89e04eeb785237e 100644 (file)
--- 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