[igraph] help need for the fast community detection algorithm
From:
Xing Jiang
Subject:
[igraph] help need for the fast community detection algorithm
Date:
Thu, 26 Jul 2007 16:06:58 +0800
Hi All,
I am now using igraph for community structure detection. I write a very simple program to call the igraph library. I want to see what the result is on the club graph shown in the example. However, I see this algorithm does not work and no partition performed.
the graph I want to test have 8 edges.Its structure is like
1 5 0 3 ------4 7 2 6
node {0, 1, 2,3} & {4,5,6,7} are two cliques.
It is supposed to have two sub structures detected. However, I do not obtain such results. I test on NewMan's code. it works. But igraph does not work.