More plans.

diff --git a/PLAN b/PLAN
index 82904539bfb4c8eae0856c3a89ff72c4a9826844..3ef63c6ef3e98e823ad1f3950ac3f87220ec613e 100644 (file)
--- a/PLAN
+++ b/PLAN
@@ -53,8 +53,9 @@ Spanning trees:
 - cite Eisner's tutorial \cite{eisner:tutorial}
 - \cite{pettie:onlineverify} online lower bound
 - 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
-- reference to mixed Boruvka-Jarnik
+- 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