GraphHopper.com | Forum | GitHub | Maps | Blog

Where does the bidirectional search meet?


#1

I would like to have a simple and elegant way how to get the point where the bidirectional search meets.
Thank you for your help!


#2

The meeting point is not necessarily the point where the final best path goes through. But of course you can get it. The first time the bestPath will get a weight < infinity this should be the meeting point as entryOther!=null for the first time. See eg. AStarBidirection.updateBestPath