igraph頻繁子圖挖掘

Question

igraph中是否有函數允許發現給定圖中的所有頻繁子圖？例如，沿着gSpan的線。

Answer 1

R得到了一個包subgraphMining，其中包括 - 已實施gSpan。但是，這取決於過時的igraph0包。

從幫助?gspan它應該是這樣的：

library(subgraphMining) 
library(igraph0) 
graph1 = graph.ring(5) 
graph2 = graph.ring(6) 

database = array(dim=2); 
database[1] = list(graph1); 
database[2] = list(graph2); 

# Call gspan, 80% frequency 
results = gspan(database, "80%"); 
results 
# [[1]] 
# Vertices: 5 
# Edges: 10 
# Directed: TRUE 
# Edges: 
# 
# [0] '1' -> '5' 
# [1] '5' -> '1' 
# [2] '2' -> '1' 
# [3] '1' -> '2' 
# [4] '3' -> '2' 
# [5] '2' -> '3' 
# [6] '4' -> '3' 
# [7] '3' -> '4' 
# [8] '5' -> '4' 
# [9] '4' -> '5'