igraph-help
[Top][All Lists]
Advanced

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

[igraph] A question about Greedy community algorithm


From: akshay bhat
Subject: [igraph] A question about Greedy community algorithm
Date: Fri, 13 Feb 2009 03:28:36 +0530

After performing Community detection the resulting Dendogram
contains merges such as
 (4834, 12676),
 (5036, 12677),
 (3744, 12329),
When there are only 12575
nodes.
what do 12677 these numbers indicate?
I have used same algorithm in c from authors website. in those results the second number never exceeds number of nodes
and that node can be considered as representative of the cluster.
http://cs.unm.edu/~aaron/research/fastmodularity.htm
Can you please clarify.
Thanks
--
Akshay Uday Bhat.
c.e.f.y.
department of chemical engineering
university institute of chemical technology
mumbai India

"One has the ability and privilege to do one's respective duty, but has no control over the
results. The fruits of work should not be the motive, for they shall follow one's actions"
Bhagvad Gita, (2.47)

reply via email to

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