在 R 中使用 igraph 查找一个图中从另一个图中丢失的唯一边

Question

我创建了两个具有以下边的无向 igraph

graph1 => A--A,A--B和A--C

graph2 => B--A、C--D、D--E和A--C

library(igraph)
my_data = data.frame(id1=c("A","A","A","B","C","A","D"),id2=c("A","B","C","A","D","C","E"))
graph1 = graph.data.frame(my_data[1:3,],directed=F)
graph2 = graph.data.frame(my_data[4:7,],directed=F)

我想找到 graph2 特有的边。因此，输出应该是这样的：

# C--D D--E

Answer 1

你可以试试

get.edgelist(graph2-graph1)
#      [,1] [,2]
# [1,] "C"  "D" 
# [2,] "D"  "E"

或者，关于您的编辑：

E(graph2-graph1)
# + 2/2 edges (vertex names):
# [1] C--D D--E

在 R 中使用 igraph 查找一个图中从另一个图中丢失的唯一边

Using igraph in R find unique edges in one graph missing from another graph

r

igraph