在R中使用igraph获取连接组件 [英] get connected components using igraph in R

问题描述

使用群集

使用

code>给予不同群集的成员资格，并使用 cliques 不给予连接的组件。

这是从

预先感谢！ 您可以使用结果从簇到根据集群大小的子集节点。

 库（igraph）
 
＃示例图
 set.seed（1）
g < -  erdos.renyi.game（20，1/20）
 V（ g）$ name<  - 字母[1:20] 
 par（mar = rep（0,4））
 plot（g） 
  

 ＃get cluster 
 cl < -  clusters（g）
 cl 
＃$ membership 
＃[1] 1 2 3 4 5 4 5 5 6 7 8 9 10 3 5 11 5 3 12 5 
＃
＃$ csize 
＃[1] 1 1 3 2 6 1 1 1 1 1 1 1 
＃
＃$ no 
＃[1] 12 
 
 
＃循环提取公共顶点
 lapply（seq_along（cl $ csize）[cl $ csize> 1]，函数（x）
 V（g）$ name [cl $ membership％in％x]）
＃[[1]] 
＃[1]cn r
＃
＃[[2]] 
＃[1]df
＃
＃[[3]] 
＃[1]eghoqt
  

I would like to find all the connected components of a graph where the components have more than one element.

using the clusters gives the membership to different clusters and using cliques does not give connected components.

This is a follow up from

multiple intersection of lists in R

My main goal was to find all the groups of lists which have elements in common with each other.

Thanks in advance!

解决方案

You can use the results from clusters to subset your nodes according to the cluster size.

library(igraph)

# example graph
set.seed(1)
g <- erdos.renyi.game(20, 1/20)
V(g)$name <- letters[1:20]
par(mar=rep(0,4))
plot(g)

# get cluster
cl <- clusters(g)
cl
# $membership
# [1]  1  2  3  4  5  4  5  5  6  7  8  9 10  3  5 11  5  3 12  5
# 
# $csize
# [1] 1 1 3 2 6 1 1 1 1 1 1 1
# 
# $no
# [1] 12


# loop through to extract common vertices
lapply(seq_along(cl$csize)[cl$csize > 1], function(x) 
                                         V(g)$name[cl$membership %in% x])
# [[1]]
# [1] "c" "n" "r"
# 
# [[2]]
# [1] "d" "f"
# 
# [[3]]
# [1] "e" "g" "h" "o" "q" "t"

这篇关于在R中使用igraph获取连接组件的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！