From 47adb8b6c491df7e51fd34e6bb45dfe3d6fe681a Mon Sep 17 00:00:00 2001
From: "simonpj@microsoft.com" <unknown>
Date: Wed, 16 Jan 2008 15:05:54 +0000
Subject: [PATCH] Comments only

---
 compiler/utils/Digraph.lhs |   10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/compiler/utils/Digraph.lhs b/compiler/utils/Digraph.lhs
index 6617459..f80b33f 100644
--- a/compiler/utils/Digraph.lhs
+++ b/compiler/utils/Digraph.lhs
@@ -83,6 +83,16 @@ instance Outputable a => Outputable (SCC a) where
    ppr (CyclicSCC vs) = text "REC" $$ (nest 3 (vcat (map ppr vs)))
 \end{code}
 
+Note [Nodes, keys, vertices]
+~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+ * A 'node' is a big blob of client-stuff
+
+ * Each 'node' has a unique (client) 'key', but the latter 
+	is in Ord and has fast comparison
+
+ * Digraph then maps each 'key' to a Vertex (Int) which is
+  	arranged densely in 0.n
+
 \begin{code}
 stronglyConnComp
         :: Ord key
-- 
1.7.10.4