[
https://issues.apache.org/jira/browse/SANDBOX-457?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Rodion Efremov updated SANDBOX-457:
-----------------------------------
Attachment: SANDBOX-457.patch
Added javadoc to buildPath(V, V, V, PredecessorList<V, WE, W>), and removed
java.util.Deque from UniVsBiDijkstraBenchmarkTestCase.java.
> Adding an implementation of a bidirectional Dijkstra's algorithm
> ----------------------------------------------------------------
>
> Key: SANDBOX-457
> URL: https://issues.apache.org/jira/browse/SANDBOX-457
> Project: Commons Sandbox
> Issue Type: New Feature
> Components: Graph
> Reporter: Rodion Efremov
> Priority: Minor
> Labels: newbie, performance
> Attachments: bidir.patch, SANDBOX-457.patch
>
>
> The bidirectional Dijkstra's algorithm as described in [these
> slides|http://www.cs.princeton.edu/courses/archive/spr06/cos423/Handouts/EPP%20shortest%20path%20algorithms.pdf].
> Performed around 10 times faster than unidirectional variant in the supplied
> benchmark.
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see: http://www.atlassian.com/software/jira
