图形工具 - K-最短路径 - 提高::协程没有在编译时发现 [英] graph-tool - k-shortest path - boost::coroutine was not found at compile-time

查看:209
本文介绍了图形工具 - K-最短路径 - 提高::协程没有在编译时发现的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!

问题描述

我试图找到自己向图中两个节点之间的第k最短路径。为此我跑code以下片段:

I am trying to find the k shortest paths between two nodes in my directed graph. To this end I run the following snippet of code:

g = load_graph('graph.xml')
source = find_vertex(g,g.vp.xrn, '774123')
source = source[0]
target = find_vertex(g,g.vp.xrn,'636131')
target = target[0]
for path in all_shortest_paths(g,source,target):
  print path

这将返回以下错误:

Traceback (most recent call last):
  File "<stdin>", line 1, in <module>
  File "/usr/lib/python2.7/dist-packages/graph_tool/topology/__init__.py", line 1532, in all_shortest_paths
    _prop("v", g, all_preds_map))
RuntimeError: This functionality is not available because boost::coroutine was not found at compile-time

有什么想法,为什么这可能是这样,我怎么能解决这个问题?

Any thoughts as to why that might be the case and how I could solve the problem?

推荐答案

这是Debian中的错误,而不是在图形工具。它已经被报道
固定: http://bugs.debian.org/cgi-bin/ bugreport.cgi?错误= 802509

This is a bug in Debian, not in graph-tool. It has already been reported and fixed: http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=802509

这篇关于图形工具 - K-最短路径 - 提高::协程没有在编译时发现的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!

查看全文
登录 关闭
扫码关注1秒登录
发送“验证码”获取 | 15天全站免登陆