Hi, you need the list of triangles? Or just the number of them?
In the latter case do a motif detection. The former is more
difficult, i'm afraid that you need to modify some C code for
that.
G.
On Fri, May 16, 2008 at 03:44:38PM +0200, Lacón Grelos wrote:
Hi i-graphers
I am trying to recover all triangles (3-cliques) in my graph (200000
nodes and 1.2 Million links) with the igraph function "cliques".
Unfortunately computation time is huge (>1day !). I was wondering
wether this is normal and if there is any other faster way to get the
k-cliques in my graph (with k small).
Thanks in advance.
Best
_______________________________________________
igraph-help mailing list
address@hidden
http://lists.nongnu.org/mailman/listinfo/igraph-help
--
Csardi Gabor <address@hidden> UNIL DGM
_______________________________________________
igraph-help mailing list
address@hidden
http://lists.nongnu.org/mailman/listinfo/igraph-help