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

[John V. S. <js...@ya...>]

Stuart and I were discussing a related topic offline (performance vs. 
genericity).  Using multiple implementations, we could leave it up to 
the user to decide, although that means more to maintain.  When Barak 
gets back, let's see where he wants to go with all of this.

JVS

Michael Behrisch wrote:
> -----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-----
> 
> 
> -------------------------------------------------------
> This sf.net email is sponsored by:ThinkGeek
> Welcome to geek heaven.
> http://thinkgeek.com/sf
> _______________________________________________
> jgrapht-developers mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-developers