graph theory - what is the best algorithm for digraphs -
i'm working on project in community detection. have 2 csv files nodes
, edges
, want detect optimal number of communities using implemenation of community detection algorithms. graph oriented, have 5577 nodes , 26000 edges.
my question , used gephi software wasn't helpfl me , added many nodes me , number of communities not optimal , there implementation can used not detect communities explore them exemple know nodes each community contains.
thank in advance.
Comments
Post a Comment