* Re: RE: RE: RE: [Caml-list] Priority queues, reloaded
[not found] <fa.mytTzuC/urRZYFkpPYr+9ZKcYVw@ifi.uio.no>
@ 2011-07-15 14:01 ` Radu Grigore
0 siblings, 0 replies; only message in thread
From: Radu Grigore @ 2011-07-15 14:01 UTC (permalink / raw)
To: fa.caml; +Cc: caml-list
On Thursday, July 14, 2011 6:34:16 PM UTC+1, Jon Harrop wrote:
> Yes. That shows that it can be done but not that it is worth doing. What are
> the practical applications (if any) of heap-based MST algorithms?
From the same file:
"Conclusions. The winning algorithm, of the four methods considered here, on problems of the size considered here, is clearly Jarn{\'\i}k/Prim with binary heaps. Second is Kruskal with radix sorting, on sparse graphs, but the Fibonacci heap method beats it on dense graphs."
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2011-07-15 14:01 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
[not found] <fa.mytTzuC/urRZYFkpPYr+9ZKcYVw@ifi.uio.no>
2011-07-15 14:01 ` RE: RE: RE: [Caml-list] Priority queues, reloaded Radu Grigore
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).