BFS has the drawback of being a 'blind' search, which means that when the search space is large, the search performance will be inferior to other heuristic searches. For the binary first search algorithm to work properly, all of the associated vertices must be saved in memory, which means it uses more memory. Another drawback is that it has extensive pathways, even though all paths to a target have almost the same search depth.