如何計算某個組的節點之間的邊數？

Question

我有以下數據集和下面的腳本：

library(GGally) 
library(ggnet) 
library(network) 
library(sna) 
library(ggplot2) 

# edgelist 
e <- data.frame(sender = c(1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 5), 
       receiver = c(2, 3, 4, 5, 1, 3, 1, 1, 2, 2, 4, 3, 2, 4)) 

# information about the nodes (vertices) 
v <- data.frame(actors = c(1, 2, 3, 4, 5), 
       groups = c("A", "A", "B", "C", "D")) 

net <- network(e, directed = TRUE) 

x = data.frame(actors = network.vertex.names(net)) 
x = merge(x, v, by = "actors", sort = FALSE)$groups 

net %v% "group" = as.character(x) 

y = RColorBrewer::brewer.pal(9, "Set1")[ c(3, 1, 9, 6, 8) ] 
names(y) = levels(x) 

ggnet2(net, color = "group", palette = y, alpha = 0.75, size = 4, edge.alpha = 0.5, arrow.size = 8, arrow.gap = 0.01) 

有一種簡單而快速的方式從節點組計算邊緣的數量（A，B，C，d）同一組的節點或另一組節點（即來自AA，AB，AC，AD，BA等）？

network-Package中有network.edgecount。但是我怎樣才能將它應用於我的問題？

Answer 1

mixingmatrix功能從network伎倆。它顯示團體內部和團體之間的關係數量，並進行同質混合和混合混合。

> mixingmatrix(net, "group") 
     To 
From A B C D Total 
    A  3 2 1 1  7 
    B  3 0 1 0  4 
    C  1 1 0 0  2 
    D  0 0 1 0  1 
    Total 7 3 3 1 14