[jgrapht-developers] Fibonacci Heaps

[Michael B. <beh...@in...>]

=2D----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Hello,
at the moment there are two FibonacciHeap implementations
(one in util, one in experimental.heap) and I would like to know,
whether we want to decide to use only one of them or join them.

I would (of course) prefer my implementation (perhaps after=20
adding the union method) because it provides an interface to
use other heaps as well, can handle arbitrary elements and=20
orderings using Comparators and can do min and max heaps.

If you agree I would move the files and adapt the=20
ClosestFirstIterator (anything else?)

Michael
=2D----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.2.4 (GNU/Linux)

iD8DBQFBSW9AZDyR4hR8HnQRAvRSAJ9Af8326zq9e4lPAUFifcWpgZvXbgCfVos4
a+DylInk6a34I5KumO8CRp0=3D
=3DA3MR
=2D----END PGP SIGNATURE-----