# Is it possible to make the Breadth First Search Algorithm recursive?

I'm a student an I see the BFS Algorithm for graph exploration. I see the DFS algorithm too and this one is easily thinkable in a recursive mode. But is it possible for the BFS?

Thanks.

-