Rodion Efremov created SANDBOX-460:
--------------------------------------
Summary: 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
Fix For: Nightly Builds
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
