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

FibonacciHeap enters in an infinite loop when applying SpannigTree algorithms

Attach filesAttach ScreenshotVotersWatch issueWatchersCreate sub-taskLinkCloneUpdate Comment AuthorReplace String in CommentUpdate Comment VisibilityDelete Comments
    XMLWordPrintableJSON

Details

    • Bug
    • Status: Resolved
    • Major
    • Resolution: Fixed
    • Nightly Builds
    • Nightly Builds
    • Graph
    • None

    Description

      Just replacing the PriorityQueue with the FibonacciHeap in spanning tree algorithms, looks like procedures enter in an infinite loop.

      There is something wrong in the data structure - what is really strange is that shortest path algorithms are not affected by the same issue...

      Attachments

        Activity

          This comment will be Viewable by All Users Viewable by All Users
          Cancel

          People

            marco.speranza Marco Speranza
            simone.tripodi Simone Tripodi
            Votes:
            0 Vote for this issue
            Watchers:
            2 Start watching this issue

            Dates

              Created:
              Updated:
              Resolved:

              Slack

                Issue deployment