[SANDBOX-425] FibonacciHeap enters in an infinite loop when applying SpannigTree algorithms

• Type: Bug
• Status: Resolved
• Priority: Major
• Resolution: Fixed
• Affects Version/s: Nightly Builds
• Fix Version/s: Nightly Builds
• Component/s: Graph
• Assignee: Marco Speranza
• Reporter: Simone Tripodi
• Created: 10/Jul/12 08:57
• Updated: 11/Jul/12 10:07
• Resolved: 11/Jul/12 10:02

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