Множественный рекурсивный вызов функции

bFSearch start finish visited = bFSearch` [] (getAdjacent start)  -- вот тут проблема
    where bFSearch` res current = (
        if (finish == current)
            then res ++ current
            else (
                if (current `elem` visited)
                    then " "
                    else bFSearch` (res ++ current) (getAdjacent current))) -- и вот тут

mark :: [Int] -> Int -> Int -> [Int]
mark chk n m | (n == 0) = m : (tail chk)
             | otherwise = (head chk) : (mark (tail chk) (n-1) m)
 
newV :: [[Int]] -> Int -> [Int] -> [Int] -> [Int]
newV g n chk que = (filter (\ x -> (chk !! x) == 0) (g !! n))
 
setP :: [Int] -> Int -> [Int] -> [Int]
setP pth n [] = pth
setP pth n (f:fs) = setP (mark pth f n) n fs
 
bfs' :: [[Int]] -> [Int] -> [Int] -> [Int] -> [Int]
bfs' g [] chk pth  = pth 
bfs' g que chk pth = (bfs' g (tq ++ nV) (setP chk 1 nV) (setP pth hq nV))
                     where tq=(tail que); hq=(head que); nV=(newV g hq chk tq);
 
showPath :: [Int] -> Int -> [Int]
showPath pth n | (pth !! n) == negate 1 = [n]
               | otherwise = n : (showPath pth (pth !! n))
                    
bfs :: [[Int]] -> Int -> Int -> [Int]  -- главная функция
bfs g n m = reverse $ showPath (bfs' g [n] (mark chk n 1) pth) m 
            where chk=(take k (repeat 0)); pth=(mark chk n (negate 1)); k=length g

Main> bfs [[1,2],[0,2,3,4],[0,1,4],[1,4],[1,2,3,5],[4,6],[5]] 0 6
[0,1,4,5,6]
Main> bfs [[1,2],[0,2,3,4],[0,1,4],[1,4],[1,2,3,5],[4,6],[5]] 2 5
[2,4,5]