The current git version of the code fixed my problem.  Thank you!
-Lisa

On Fri, Oct 3, 2014 at 10:37 AM, lmz <lisa.zorn@sfcta.org> wrote:
Aha that does sound promising!   I'll try pulling the current git version and see if it fixes it.
Thank you both!
-Lisa

On Fri, Oct 3, 2014 at 1:21 AM, paob [via Main discussion list for the graph-tool project] <[hidden email]> wrote:
Hi Lisa,

I recently posted Issue #188: https://git.skewed.de/count0/graph-tool/issues/188 which Tiago resolved in the current master branch.

Can you run the simple example I posted? I see in your path_debug.py that you use shortest_distance with a specified target which in version 2.2.35 stops the search as soon as the target node is discovered during Dijkstra's algorithm.

If this is the problem then you either need to compile the current (git) version of graph-tool or to wait for the next pre-compiled packages.

Hope that helps,
Paul


To unsubscribe from unexpected shortest_path result, click here.
NAML



View this message in context: Re: unexpected shortest_path result
Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com.

_______________________________________________
graph-tool mailing list
graph-tool@skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool