Replies: 2 comments 5 replies
-
No, once the best (least cost) path from A-B has been found the method exits. At any one edge, only the predecessor edge with least cost to the edge is stored, so there is no way to get less optimal paths (apart from the route alternates functionality). |
Beta Was this translation helpful? Give feedback.
3 replies
-
Check the api docs - there is an alternates request parameter that allows multiple routes to be returned. Others may add details on the implementation as I am not familiar with that code. |
Beta Was this translation helpful? Give feedback.
2 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
In bidrectional_astar.cc, we have GetBestPath. If I want to see all of the possible paths that could have been traversed, is there a way to see or save those? This function, as the name says, gets the one singular best path, but can we save and see every less-than-optimal path from A to B?
Beta Was this translation helpful? Give feedback.
All reactions