I’m working on a bidirectional search algorithm to improve the time complexity of my unidirectional search. The idea is to start the search from both the start and goal nodes simultaneously, and have them meet at a middle point with shortest distance. This way, I can ensure that I find the shortest path possible.