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."
--
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
