What Does Bidirectional Search Mean?

Bidirectional search is a type of search and sort activity that combines two directional approaches, so that the generator in question searches in two directions at the same time.

Experts sometimes define bidirectional search as a “brute force search algorithm” that requires an explicit goal state or orienting desired result in order to proceed. Another way to think about bidirectional search is that it’s in contrast to a single directional search that only goes from the top of the system to the bottom.