从get.shortest.paths（）中找出路线的距离

Question

我在R中使用igraph包来做一些相当简单的事情：计算网络中两个节点之间的最短距离。 有没有一种直接的方法来提取通过get.shortest.paths()计算的路径的距离？

以下是一些可重现的代码，可以解释我的问题：

## reproducible code:
df2 = rbind(c(234,235,21.6),
c(234,326,11.0),
c(235,241,14.5),
c(326,241,8.2),
c(241,245,15.3),
c(234,245,38.46))

df2 = as.data.frame(df2)
names(df2) = c("start_id","end_id","newcost")

require(igraph)

g2 <- graph.data.frame(df2, directed=FALSE)

class(g2)

print(g2, e=TRUE, v=TRUE)

## calculate shortest path between vertex 234 and 245
(tmp2 = get.shortest.paths(g2, from='234', to='245',weights=E(g2)$newcost))

## print route vertices:
V(g2)[tmp2[[1]]]

## print distance of each route segment:
## ??

## calculate distance using 'newcost' weights:
## ?? sum( route segments ) ??

Answer 1

您可以使用shortest.paths函数，例如：

# compute the min distances from '234' to all other vertices
tmp3 <- shortest.paths(g2,v='234',weights=E(g2)$newcost)

# print min distance from '234' to '245'
tmp3[1, which(V(g2)$name == '245')]

---

算法计算的距离为34.5 = 11 + 8.2 + 15.3 ，如下图所示：