Search in half graph?

Is there any way that I can search in half of the graph only?

Suppose I have a grid graph having 200x200 nodes and I know my starting point and end point is within only half or 1/4th of the total graph. Is there any way so that they don’t need to check in all direction and get result quickly.


The A* algorithm will do that automatically. It will search as few nodes as possible in order to find the target.