Updated PLAN.

diff --git a/PLAN b/PLAN
index 891c896dd0d1c0dc049ee143adfb5e21708412a9..6ee8b132f5d734f243ceafbecd12d8ffd3f88207 100644 (file)
--- a/PLAN
+++ b/PLAN
@@ -50,9 +50,9 @@ TODO:
 
 Preface:
 
-- move TOC to the beginning of the book
 - mention notation
 - cite GA booklet
+- mention bugs in Valeria's verification paper
 
 - G has to be connected, so m=O(n)
 
@@ -60,8 +60,6 @@ Spanning trees:
 
 - cite Eisner's tutorial \cite{eisner:tutorial}
 - Some algorithms (most notably Fredman-Tarjan) do not need flattening
-- use the notation for contraction by a set
-- mention bugs in Valeria's verification paper
 * Lemma: deletion of a non-MST edge does not alter the MST
 
 Related:
@@ -83,12 +81,13 @@ Ranking:
 Notation:
 
 - use \delta(X) notation
+- use the notation for contraction by a set
 - unify use of n(G) vs. n
 - introduce \widehat\O early
 
 Typography:
 
-- formatting of multi-line \algin, \algout
+* formatting of multi-line \algin, \algout
 - use calligraphic letters from ams?
 
 Global: