úÎ ƒportable experimental/Sebastian Fischer (sebf@informatik.uni-kiel.de)  The function bfs enumerates the results of a 7 non-deterministic computation in breadth-first order.  The function idfs& computes the levels of a depth bound B computation using iterative deepening depth-first search. Unlike D breadth-first search it runs in constant space but usually takes a ? bit longer, depending on how the depth limit is increased. Don't C use this algorithm if you know that there is only a finite number @ of results because it will continue trying larger depth limits 7 without recognizing that there are no more solutions.  The function idfsBy& computes the levels of a depth bound : computation using iterative deepening depth-first search ? incrementing the depth limit between searches using the given  number of steps.    level-monad-0.4Control.Monad.LevelsbfsidfsidfsBy DepthBound!Levelslevels runLevelsmerge