[Top][All Lists]

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

Re: [igraph] Question on igraph_community_fastgreedy

From: Gabor Csardi
Subject: Re: [igraph] Question on igraph_community_fastgreedy
Date: Wed, 27 Feb 2008 22:44:54 +0100
User-agent: Mutt/1.5.13 (2006-08-11)

There is a MATRIX macro:

MATRIX(m, i, j) is the (i,j) element of 'm', you can also assign to it:
MATRIX(m, i, j) = 0;

See more here: 

Feel free to ask if you have more questions,

On Wed, Feb 27, 2008 at 04:39:15PM -0500, Richard Geddes wrote:
> Thanks.
> One other question: I've learned how to play with the igraph_vector_t
> container... I think Gabor showed me by example a while back... how can
> I iterate through the igraph_matrix_t?   Is there a generalized
> description of the igraph containers?
> R
> Tamas Nepusz wrote:
> >> const igraph_vector_t *weights
> >>
> >> argument has no description... are these the weights described as the
> >> heuristics in the Wakita paper?
> > No, the heuristics described in the Wakita paper are still waiting to
> > be implemented... :( These are simply edge weights. In the weighted
> > case, the "degrees" of the vertices are defined as the sum of the
> > weights of their adjacent edges, and m (in the original formula) is
> > replaced by the sum of the weights along all the edges. This extension
> > was briefly mentioned in the original paper of Newman.
> >
> >> Also, if I'm not interested in weights, can I use NULL?
> > Yes.
> >
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help

Csardi Gabor <address@hidden>    UNIL DGM

reply via email to

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