[jira] [Commented] (SANDBOX-457) Adding an implementation of a bidirectional Dijkstra's algorithm

["Simone Tripodi (JIRA)" <ji...@apache.org>]

    [ https://issues.apache.org/jira/browse/SANDBOX-457?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13661329#comment-13661329 ] 

Simone Tripodi commented on SANDBOX-457:
----------------------------------------

Patch is shiny like a sunshine, congratulations!

I have just 3 small kind requests:

 * please add a javadoc comment to the new method {{PredecessorsList#buildPath( V source, V touch, V target, PredecessorsList<V, WE, W> backwardsList ) }}
 * Remove {{java.util.Deque}} interface from {{UniVsBiDijkstraBenchmarkTestCase}}, target JDK is 1.5 - I know, Java5 reached EOL but a lot of companies still have even JDK1.4...
 * resubmit the patch naming it with the issue id, i.e. {{SANDBOX-457.patch}}

TIA, all the best!
                
> 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
>
>
> 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