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
If you reply to this email, your message will be added to the discussion below:http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/unexpected-shortest-path-result-tp4025765p4025768.html