[Top][All Lists]

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

Re: [igraph] Question on igraph_community_fastgreedy

From: Richard Geddes
Subject: Re: [igraph] Question on igraph_community_fastgreedy
Date: Wed, 27 Feb 2008 16:39:15 -0500
User-agent: Thunderbird (X11/20071022)


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?


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.

reply via email to

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