R:“;“连接”;图
使用R,我创建并绘制了一个图形:R:“;“连接”;图,r,graph,data-visualization,nodes,R,Graph,Data Visualization,Nodes,使用R,我创建并绘制了一个图形: library(igraph) library(igraphdata) data(karate) #cluster cfg <- cluster_fast_greedy(karate) #plot entire graph plot(cfg, karate) #plot first subgraph a = induced_subgraph(karate, cfg[[1]]) plot(a) #plot second subgraph b =
library(igraph)
library(igraphdata)
data(karate)
#cluster
cfg <- cluster_fast_greedy(karate)
#plot entire graph
plot(cfg, karate)
#plot first subgraph
a = induced_subgraph(karate, cfg[[1]])
plot(a)
#plot second subgraph
b = induced_subgraph(karate, cfg[[2]])
plot(b)
#plot third subgraph
c = induced_subgraph(karate, cfg[[3]])
plot(c)
库(igraph)
图书馆(igraphdata)
数据(空手道)
#簇
cfg对于二进制情况,问题是社区之间是否存在连接,您可以执行以下操作。首先,根据社区成员资格(属于“a”、“b”或“c”)与社区签订合同
他的回答很好。我发布了另一个关于使用社区检测与常规集群的理想情况的问题(例如,k均值)。如果你有时间,请你看一下好吗?非常感谢。
V(karate)$mem <- membership(cfg)
g <- contract.vertices(karate, V(karate)$mem, vertex.attr.comb = "ignore")
g <- simplify(g)
sapply(1:vcount(g), function(x) adjacent_vertices(g, x))