如何从R中的igraph对象获取树？

debugcn 发表于 Dev

缺口

我有一个随机的有向加权图gg，它具有下一个结构：

gg <-
structure(list(10, TRUE, c(0, 0, 1, 2, 2, 5, 5, 6, 6, 6, 6, 9,
9, 9, 9, 9), c(6, 9, 3, 0, 5, 3, 7, 1, 3, 5, 8, 2, 4, 6, 7, 8
), c(0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15), c(3,
7, 11, 2, 5, 8, 12, 4, 9, 0, 13, 6, 14, 10, 15, 1), c(0, 2, 3,
5, 5, 5, 7, 11, 11, 11, 16), c(0, 1, 2, 3, 6, 7, 9, 11, 13, 15,
16), list(c(1, 0, 1), structure(list(), .Names = character(0)),
    structure(list(name = c("C", "D", "I", "J", "K", "N", "O",
    "Q", "S", "T"), color = c("yellow", "red", "red", "red",
    "red", "red", "green", "red", "red", "green")), .Names = c("name",
    "color")), structure(list(weight = c(0.5, 0.5, 1, 0.333333333333333,
    0.333333333333333, 0.333333333333333, 0.333333333333333,
    0.25, 0.25, 0.25, 0.25, 0.2, 0.2, 0.2, 0.2, 0.2)), .Names = "weight")),
    <environment>), class = "igraph")

我需要找到从根（黄色节点）到叶子（红色节点）的所有游走路线。由（a）边缘方向和（b）距离-从根到叶的距离定义的叶子应该只有两个边缘。

在我的情况下，根为C，叶子应为D, J, N, S, I, K, Q。我试图仅定义（a）条件。

root <- "C"
leaves = which(degree(gg, v = V(gg), mode = "out")==0, useNames = T)
leaves 
# J K Q S 
# 4 5 8 9 
plot(gg, layout = layout.reingold.tilford(gg, root=root),
        edge.arrow.size=0.2, edge.curved=T,
        edge.label = round(E(gg)$weight,2))

问题。如何定义（b）条件并添加到叶子集D, N, I, K节点？

问

这是一种实现方法：用于shortest_paths获取与根节点恰好是两个边的所有顶点。

two.edges.from.root = unlist(sapply(shortest_paths(gg,
                                                   from = as.numeric(V(gg)["C"]),
                                                   mode = "out")$vpath,
                                    function(x) { if(length(x) == 3) { x[3] } }))

本文收集自互联网，转载请注明来源。

如有侵权，请联系[email protected] 删除。