[jgrapht-developers] Dijkstra, ShortestPath and simple TSP Alg

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

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Hello,

I checked some source code and unfortunately noticed only afterwards 
that there is already a Dijkstra (and even a FibonnacciHeap). I would
like to have different heaps, because in practice the Fibo is often
slower than a simple BinaryHeap (although this one does not meet
the hard runtime bounds). Maybe we move the heap package one up
and let runtime-tests decide which of the implementations of the Fibo 
to choose?

Michael
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.0.7 (GNU/Linux)

iD8DBQE/ZbVIZDyR4hR8HnQRAqmyAJ9ckJThlyeQrPFGqX/0caKzb3JmNACfY5Vg
sBHEV+QMBcVJHn7dsqP7yDg=
=Gfpr
-----END PGP SIGNATURE-----