* Re: RE: RE: [Caml-list] Priority queues, reloaded [not found] <fa.4hGHoqPJ9l0IDNSTin/BjbNP0Hc@ifi.uio.no> @ 2011-07-13 20:00 ` Radu Grigore 2011-07-14 17:33 ` Jon Harrop 0 siblings, 1 reply; 2+ messages in thread From: Radu Grigore @ 2011-07-13 20:00 UTC (permalink / raw) To: fa.caml; +Cc: caml-list On Wednesday, July 13, 2011 7:59:38 PM UTC+1, Jon Harrop wrote: > Moreover, do you actually need a heap in the MST algorithm? Didn't you just quote the part that says Algorithm 1 uses radix sort? ^ permalink raw reply [flat|nested] 2+ messages in thread
* RE: RE: RE: [Caml-list] Priority queues, reloaded 2011-07-13 20:00 ` RE: RE: [Caml-list] Priority queues, reloaded Radu Grigore @ 2011-07-14 17:33 ` Jon Harrop 0 siblings, 0 replies; 2+ messages in thread From: Jon Harrop @ 2011-07-14 17:33 UTC (permalink / raw) To: caml-list Radu Grigore wrote: > On Wednesday, July 13, 2011 7:59:38 PM UTC+1, Jon Harrop wrote: > > Moreover, do you actually need a heap in the MST algorithm? > > Didn't you just quote the part that says Algorithm 1 uses radix sort? 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? Cheers, Jon. ^ permalink raw reply [flat|nested] 2+ messages in thread
end of thread, other threads:[~2011-07-14 17:33 UTC | newest]
Thread overview: 2+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
[not found] <fa.4hGHoqPJ9l0IDNSTin/BjbNP0Hc@ifi.uio.no>
2011-07-13 20:00 ` RE: RE: [Caml-list] Priority queues, reloaded Radu Grigore
2011-07-14 17:33 ` Jon Harrop
This is a public inbox, see mirroring instructions for how to clone and mirror all data and code used for this inbox