Hello -- I am getting an unexpected shortest path (with weighted costs) result. I have isolated it to a simple script to illustrate; the files are at http://www.sfcta.org/downloads/lmz/ Files: - graph: graph_after_1iter_157_277.xml.gz - python script to illustrate my issue: path_debug.py - log file output of python script: path_debug.log The workbook, path_debug.xls, is just an excel version of path_debug.log with a calculated column (in orange) inserted to show what I expect to be the shortest distance to the given vertex. The script path_debug.py: 1) finds the shortest path from a source to a target and prints the details 2) prints the details of what I expect to be the shortest path I cannot figure out why the second path has the cost that it's printing... Mostly it's as expected, but the yellow highlighted cells are what baffles me. The graph is a pseudo-dual network so it's a bit confusing; the vertices symbolize links in a street network and the edges symbolize a turn from the incoming link to the outgoing link. Any help would be greatly appreciated! -Lisa -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/... Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com.