[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 2.0.0.6 (X11/20071022) |
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] Question on igraph_community_fastgreedy, Richard Geddes, 2008/02/27
- Re: [igraph] Question on igraph_community_fastgreedy, Tamas Nepusz, 2008/02/27
- Re: [igraph] Question on igraph_community_fastgreedy,
Richard Geddes <=
- RE: [igraph] Question on igraph_community_fastgreedy, Thomas F. Brantle, 2008/02/27
- Re: [igraph] Question on igraph_community_fastgreedy, Tamas Nepusz, 2008/02/27
- RE: [igraph] Question on igraph_community_fastgreedy, Thomas F. Brantle, 2008/02/27
- Re: [igraph] Question on igraph_community_fastgreedy, Tamas Nepusz, 2008/02/27
- Re: [igraph] Question on igraph_community_fastgreedy, Richard Geddes, 2008/02/28
- Re: [igraph] Question on igraph_community_fastgreedy, Gabor Csardi, 2008/02/28