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

• Type: Improvement
• Status: Closed
• Priority: Trivial
• Resolution: Not A Problem
• Affects Version/s: Nightly Builds
• Fix Version/s: Nightly Builds
• Component/s: Graph
• Labels: patch
• Assignee: Unassigned
• Reporter: Rodion Efremov
• Created: 25/Jul/13 13:45
• Updated: 25/Jul/13 13:53
• Resolved: 25/Jul/13 13:53

Description

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.

Issue Links

• is blocked by: SANDBOX-457 Adding an implementation of a bidirectional Dijkstra's algorithm