R之网络关系图

#网络关系图

rm(list = ls())
library(igraph)
g<- graph(c(1,2, 1,8,1,9,1,10,2,4,2,5,2,6,2,3,3,7,3,11,3,12,3,1), directed=T)
com = walktrap.community(g, steps = 6)
V(g)$sg = com$membership + 1
V(g)$color = rainbow(max(V(g)$sg))[V(g)$sg]
plot(g, layout=layout.fruchterman.reingold,edge.color=grey(0.4),edge.arrow.mode=">",vertex.size=20,vertex.color=V(g)$color)

转载于:https://www.cnblogs.com/xyqiu90-365/p/9798022.html