Find distance of route from get.shortest.paths()

有些话、适合烂在心里 提交于 2019-11-30 07:35:55

You can use shortest.paths function, e.g.:

# 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')]

The distance computed by the algorithm is 34.5 = 11 + 8.2 + 15.3, as shown in the following picture:

易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!