You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@commons.apache.org by GitBox <gi...@apache.org> on 2021/08/19 12:50:14 UTC

[GitHub] [commons-graph] coderodde opened a new pull request #6: Load balance the bidirectional Dijkstra's algorithm

coderodde opened a new pull request #6:
URL: https://github.com/apache/commons-graph/pull/6


   Since bidirectional Dijkstra's algorithm grows two search areas growing towards each other, it makes sense to remove the next node to settle from the smaller search area. (In the opposite case, it would degrade to a unidirectional Dijkstra's algorithm).


-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: issues-unsubscribe@commons.apache.org

For queries about this service, please contact Infrastructure at:
users@infra.apache.org