Bidirectional search

Bidirectional search is an efficient way to find a path between two points in a network, like a map. Instead of exploring the entire route from the start to the end, it searches simultaneously from both the starting point and the goal. When the two searches meet, a complete path is found. This approach reduces the amount of work needed compared to searching from just one side, making the process faster—especially in large or complex networks. It's like two people searching toward each other in a maze, stopping when they meet.