[REBOL] Re: Boruvka's Minimum Spanning Tree algorithm
From: lmecir:mbox:vol:cz at: 19-May-2004 18:39
Brett Handley napsal(a):>Hi Ladislav, > >I like your choice of edge representation - flexible. >....snip... yes, that was my primary goal, but for this algorithm (and maybe for some other), the adjacency structure used instead of a block of graph edges might lead to a simpler formulation. (But there would be a problem, where to store edge weights - any idea?) -L