BFS is faster than DFS in all cases

BFS explores nodes level by level, while DFS explores as deep as possible before backtracking

BFS uses a stack while DFS uses a queue

DFS uses a priority queue, while BFS uses a simple list

BFS works only on directed graphs