[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] MST

From: Vincent Matossian
Subject: Re: [igraph] MST
Date: Mon, 27 Nov 2006 16:15:30 -0500

Hi Gabor,

while porting some code on another machine I noticed that the 0.3 release still has a missing FINALLY_CLEAN counter (instead of 2 it should be 3) for minimum spanning tree prim.



On 11/25/06, Csardi Gabor <address@hidden> wrote:

you're right, Free(already_processed) was missing, sorry about that.

Btw. another 0.3 version is uploaded to
if you want to do some tests. This has the neighborhood functions, also in R.
I haven't tried it on windows yet though, so compilation still fails if you
don't erase the cpp files.


On Sat, Nov 25, 2006 at 12:30:44AM -0500, Vincent Matossian wrote:
>  Hi,
> minimum.spanning.tree was giving me trouble on code such as
> gsf=barabasi.game(100,directed=FALSE)
> ngsf2=list()
> E(gsf)$w=sample(1:20,ecount(gsf),replace=TRUE)
> ng2=neighborhood(gsf,2)
> for(i in 1:length(ng2)){
> ngsf2[[i]]=minimum.spanning.tree(ng2[[i]],weights=E(ng2[[i]])$w)
> }
> I noticed that the code in the working directory was short of one FINALLY
> cleanup of the stack. It all works well after that extra cleanup.
> Just thought I'd let you know
> Cheers,
> vincent

> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help

Csardi Gabor <address@hidden>    MTA RMKI, ELTE TTK

igraph-help mailing list

reply via email to

[Prev in Thread] Current Thread [Next in Thread]