Simone Tripodi created SANDBOX-425: -------------------------------------- Summary: FibonacciHeap enters in an infinite loop when applying SpannigTree algorithms Key: SANDBOX-425 URL: https://issues.apache.org/jira/browse/SANDBOX-425 Project: Commons Sandbox Issue Type: Bug Components: Graph Affects Versions: Nightly Builds Reporter: Simone Tripodi Fix For: Nightly Builds
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... -- This message is automatically generated by JIRA. If you think it was sent incorrectly, please contact your JIRA administrators: https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa For more information on JIRA, see: http://www.atlassian.com/software/jira