From 0a1270f1092ebf56af5b8e4263220f7a5f509f74 Mon Sep 17 00:00:00 2001 From: Neil Brown Date: Tue, 29 Jan 2008 12:44:06 +0000 Subject: [PATCH] Corrected a comment in FlowAlgorithms --- common/FlowAlgorithms.hs | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/common/FlowAlgorithms.hs b/common/FlowAlgorithms.hs index 09887d5..30cec25 100644 --- a/common/FlowAlgorithms.hs +++ b/common/FlowAlgorithms.hs @@ -37,7 +37,8 @@ data GraphFuncs n e a = GF { -- TODO further in the future, consider making this work nicely with the inductive graph rather than using node lists -- | Given the graph functions, a list of nodes and an entry node, performs --- an iterative data-flow analysis. +-- an iterative data-flow analysis. All the nodes in the list should be connected to +-- the entry node, and there should be no nodes without predecessors in the list. flowAlgorithm :: forall n e a. (Ord n, Show n, Eq a) => GraphFuncs n e a -> [n] -> n -> Either String (Map.Map n a) flowAlgorithm funcs nodes startNode = iterate