> First, the suspicion that lazy evaluation may lead to a non-termination > of such algorithm is almost surely wrong, and in any case it is against > my religious beliefs [some twisted smiley here]. >
Sorry to have clubbed both lazy evaluation and non-termination. I meant that Lazy eval could have given me a wrong answer. Recursive procedures can give a wrong answer, if one recursive procedure's answer is dependent on the one invoked after it. > Then, please, would you mind stating again what do you *ultimately* > want? A depth-first SEARCH of a goal node, if reachable, or the construction > of the spanning tree (through backtracking). You probably said that, but > I have probably missed that posting. > Okay, I want a DFS Spanning tree. Vimal _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
