Minor improvements.

[saga.git] / PLAN

diff --git a/PLAN b/PLAN
index 3600b29997111ed4cf328c6678ef1357fd66a03f..41930d069e731a846e0d6faa45c951c313c4d0e4 100644 (file)
--- a/PLAN
+++ b/PLAN
@@ -52,19 +52,17 @@ Preface:
 
 - move TOC to the beginning of the book
 - mention notation
+- cite GA booklet
 
 Spanning trees:
 
 - cite Eisner's tutorial \cite{eisner:tutorial}
-- move the remark on disconnected graphs? separate section?
-- mention graphs with non-unique weights? also in the separate section?
 - Some algorithms (most notably Fredman-Tarjan) do not need flattening
-- citation of mixed Boruvka-Jarnik
 - use the notation for contraction by a set
 - mention bugs in Valeria's verification paper
 - more references on decision trees
-- introduce Cut rule and Cycle rule earlier
 - Lemma: deletion of a non-MST edge does not alter the MST
+- mention that there are only a few algorithms based on the Red rule
 
 Related:
 - practical considerations: katriel:cycle, moret:practice (mention pairing heaps)
@@ -101,6 +99,9 @@ Typography:
 
 Global:
 
-- Intro: cite GA booklet
 - each chapter should make clear in which model we work
 - clean up bibliography
+
+Pictures:
+
+- structure of a Q-heap