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. -- Caml-list mailing list. Subscription management and archives: https://sympa-roc.inria.fr/wws/info/caml-list Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs
