diff options
| author | simonpj@microsoft.com <unknown> | 2008-01-16 15:05:54 +0000 |
|---|---|---|
| committer | simonpj@microsoft.com <unknown> | 2008-01-16 15:05:54 +0000 |
| commit | 47adb8b6c491df7e51fd34e6bb45dfe3d6fe681a (patch) | |
| tree | 3db35caeed0f71e0b06a034dd2b59cdce9259f8e /compiler/utils/Digraph.lhs | |
| parent | f9ad735f0b8a3262b273b8d126a65b4caf4d64f5 (diff) | |
| download | haskell-47adb8b6c491df7e51fd34e6bb45dfe3d6fe681a.tar.gz | |
Comments only
Diffstat (limited to 'compiler/utils/Digraph.lhs')
| -rw-r--r-- | compiler/utils/Digraph.lhs | 10 |
1 files changed, 10 insertions, 0 deletions
diff --git a/compiler/utils/Digraph.lhs b/compiler/utils/Digraph.lhs index 66174592a7..f80b33f870 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 |