Uploaded image for project: 'Commons Sandbox'
  1. Commons Sandbox
  2. SANDBOX-460

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

    XMLWordPrintableJSON

Details

    • Improvement
    • Status: Closed
    • Trivial
    • Resolution: Not A Problem
    • Nightly Builds
    • Nightly Builds
    • Graph

    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.

      Attachments

        Issue Links

          is blocked by

          New Feature - A new feature of the product, which has yet to be developed. SANDBOX-457 Adding an implementation of a bidirectional Dijkstra's algorithm

          • Minor - Minor loss of function, or other problem where easy workaround is present.
          • Resolved

          Activity

            People

              Unassigned Unassigned
              coderodde Rodion Efremov
              Votes:
              0 Vote for this issue
              Watchers:
              1 Start watching this issue

              Dates

                Created:
                Updated:
                Resolved:

                Time Tracking

                  Estimated:
                  Original Estimate - 48h
                  48h
                  Remaining:
                  Remaining Estimate - 48h
                  48h
                  Logged:
                  Time Spent - Not Specified
                  Not Specified