In the solution extraction method, if the meeting point is goal, the vector for the path towards goal would include goal twice (I think it is the same for start, but I am not entirely sure).
This problem also exists in DVCBS and could exist in other Bidir algorithms.
A quick test could be a problem where start is connected to goal via and edge, and the solution is proven immediately.
In the solution extraction method, if the meeting point is goal, the vector for the path towards goal would include goal twice (I think it is the same for start, but I am not entirely sure).
This problem also exists in DVCBS and could exist in other Bidir algorithms.
A quick test could be a problem where start is connected to goal via and edge, and the solution is proven immediately.