Re: [jgrapht-developers] Fibonacci Heaps

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

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

> Barak Naveh wrote:
> > as for the fibonacci heap, if think the factory/strategy approach John
> > suggested is the appropriate solution. however, a default
> > factory/strategy should be provided so that a beginner could use the
> > library without having to specify them.
> >
> > Michael, i will be away until mid-october and i dont want to bottleneck
> > your developments. You can discuss with John and whatever he decides is
> > fine with me (John, is it ok with you?). just CC me on your descussions
> > so that i can catch up quicker upon my return.
>
> Sure.  Michael, perhaps you can propose details on how you'd like to see
> the existing components refactored, and then I can give you feedback.

I'd like to have what's already in my heaps ;-) Especially arbitrary=20
Comparators for the order of the elements and the ability to create min-/an=
d=20
max-heaps. I think one could use my heaps and modify the=20
ClosestFirstIterator accordingly. If You want I can do that.

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

iD8DBQFBYS6/ZDyR4hR8HnQRAp0RAJ9QFLJbpdfAihs8Metk4/pt6FpfkACZAaer
9u1uj0zqrIqQZYqj9oVsLZI=3D
=3DJsn2
=2D----END PGP SIGNATURE-----