Bidirectional search is a graph search algorithm that finds the shortest path from an initial vertex to a goal vertex in a directed graph. It runs two simultaneous searches (which can be, e.g., two breadth-first searches): one forward from the initial state, and one backwards from the goal, stopping when the two meet.
