我想计算完整的3节点子图的数量。 原始图的节点具有名称。示例代码如下。
g <- graph.full(n=5, directed = TRUE)
# adjacency matrices
d3<-matrix(c(0,1,1,1,0,1,1,1,0),nrow=3,ncol=3)
# Turn them into a convenient list
sbgDouble.mat<-list(d3)
# And then into a list of graph objects
sbgDouble.graph<-lapply(sbgDouble.mat, graph.adjacency)
# Count the number of the full 3-node subgraph
subgraph.freq.g<-c()
subgraph.freq.g[1]<-
graph.count.subisomorphisms.vf2(g, sbgDouble.graph[[1]])
#> subgraph.freq.g
# [1] 60
更新:我已尝试graph.get.isomorphisms.vf2(g, sbgDouble.graph[[1]])
,但结果为list()
。
有人请问我如何输出3节点子图的节点名称/ ids列表?感谢。
答案 0 :(得分:0)
为了查看顶点ID,我们可以使用函数graph.get.subisomorphisms.vf2()
,例如
graph.get.subisomorphisms.vf2(g, sbgDouble.graph[[1]])[1]
[[1]]
+ 3/5 vertices:
[1] 1 2 3