It is bidirectional BFS: https://github.com/jwngr/sdow/blob/master/sdow/breadth_first_search.py https://github.com/jwngr/sdow/blob/master/sdow/breadth_first...

It is bidirectional BFS: https://github.com/jwngr/sdow/blob/master/sdow/breadth_first_search.py https://github.com/jwngr/sdow/blob/master/sdow/breadth_first... A* can't be used given that path cost or expected remaining distance is unknown. Any ideas on how such an algorithm could be used without precomputing the entire graph?