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

Posted to issues@commons.apache.org by "Rodion Efremov (JIRA)" <ji...@apache.org> on 2013/07/25 15:55:48 UTC

[jira] [Closed] (SANDBOX-460) In the uni- and bidirectional Dijkstra's algorithms there are a superfluous operations.

     [ https://issues.apache.org/jira/browse/SANDBOX-460?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Rodion Efremov closed SANDBOX-460.
----------------------------------

    Resolution: Not A Problem

Magically, that extra computation pays well.
                
> In the uni- and bidirectional Dijkstra's algorithms there are a superfluous operations.
> ---------------------------------------------------------------------------------------
>
>                 Key: SANDBOX-460
>                 URL: https://issues.apache.org/jira/browse/SANDBOX-460
>             Project: Commons Sandbox
>          Issue Type: Improvement
>          Components: Graph
>    Affects Versions: Nightly Builds
>            Reporter: Rodion Efremov
>            Priority: Trivial
>              Labels: patch
>             Fix For: Nightly Builds
>
>   Original Estimate: 48h
>  Remaining Estimate: 48h
>
> In the org.apache.commons.graph.shortestpath.DefaultShortestPathAlgorithmSelector there are such expressions as 'if (shortestDistancesForward.alreadyVisited( vertex))', which does nothing reasonable, but rather checks an invariant.

--
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