Comparison of DFS and B(readth)FS
In DFS, OPEN serves as a Stack
In BFS, OPEN serves as a Queue.
In both, CLOSED serves as a Set.
Both DFS and BFS find a solution if it exists.
BFS always finds a shortest solution (if one exists).
DFS finds some solution that depends upon the order in which successors (members of L) are determined and processed.