Basic idea is to implement bidirectional a-star, which can (or not) depending on the problem, be more efficient. So there are two priority queues. I thought it would be a nice addition to this package. However: - unlike one-directional, it is not guaranteed to find the exact optimal path. this makes it harder to test - it is solving some tests nicely, but I am still getting some unexpected results, still debugging
This issue appears to be discussing a feature request or bug report related to the repository. Based on the content, it seems to be resolved. The issue was opened by pathway and has received 6 comments.