X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=ghc%2Fcompiler%2Futils%2FDigraph.lhs;fp=ghc%2Fcompiler%2Futils%2FDigraph.lhs;h=d8f6220658945fa5a24cb2acf846f7096a802563;hb=dbc254c3dcd64761015a3d1c191ac742caafbf4c;hp=ea3b61c0ff94722962c154bba669f306795d03e9;hpb=b7cc3d012a98cc49abb3441e6637d5148f57f1d1;p=ghc-hetmet.git

diff --git a/ghc/compiler/utils/Digraph.lhs b/ghc/compiler/utils/Digraph.lhs
index ea3b61c..d8f6220 100644
--- a/ghc/compiler/utils/Digraph.lhs
+++ b/ghc/compiler/utils/Digraph.lhs
@@ -95,7 +95,7 @@ stronglyConnCompR
 	=> [(node, key, [key])]		-- The graph; its ok for the
 					-- out-list to contain keys which arent
 					-- a vertex key, they are ignored
-	-> [SCC (node, key, [key])]
+	-> [SCC (node, key, [key])]	-- Topologically sorted
 
 stronglyConnCompR [] = []  -- added to avoid creating empty array in graphFromEdges -- SOF
 stronglyConnCompR edges