/********社团发现***********/
目标:找带权重的社团选型:networkx社团发现算法很少,igraph算法多,Spark Graphx能找到高效的实现方法。
igraph: 找到社团并提取结果信息
install.packages("igraph")
library(igraph)
# This is so simple that we will have only one level
g <- make_full_graph(5) %du% make_full_graph(5) %du% make_full_graph(5) //构造三个社团,Disjoint union of graphs
g <- add_edges(g, c(1,6, 1,11, 6, 11)) //构造社团间关系
communities = cluster_louvain(g)
#extract results from detected communities
cs <- communities
membership(cs) //成员所属社团
print(cs) //社团和社团成员
modularity(cs)
length(cs) //社团个数
sizes(cs) //各社团成员数
algorithm(cs) //所用算法名