[REBOL] Re: Boruvka's Minimum Spanning Tree algorithm
From: lmecir:mbox:vol:cz at: 16-May-2004 15:39
Ladislav Mečíř napsal(a):
>I posted a Rebol implementation of Boruvka's classic Minimum Spanning
>Tree algoritm to http://www.compkarori.com/vanilla/display/Graph
>Any questions, comments, corrections and improvements welcome.
FYI, in http://www.library.cornell.edu/nr/bookcpdf/c8-6.pdf I found a
function Eclass. The algorithm of it is attributed to D.E. Knuth. I
found out, that the Eclass function if MUCH slower (for large number of
nodes), than the combination of the Components and Adjacency functions
you can find above.