On 17.11.2014 15:16, ambasta wrote: > One last bit. While using any of dijkstra/bellman_ford/astar_search function, > where is the list of edges for shortest path stored? > > pred_map is a Vertex Property Map, so while this can give me the list of > visited vertices, I still can not find the edges which were chosen. Is there > a way to retrieve a list of edges in the shortest path as well?
If your graph does not contain parallel edges, you can simply call the g.edge(pred_map[v], v) function. Otherwise you can simply store the edges in a list as they are visited, by properly modifying the visitor object. Best, Tiago -- Tiago de Paula Peixoto <[email protected]>
signature.asc
Description: OpenPGP digital signature
_______________________________________________ graph-tool mailing list [email protected] http://lists.skewed.de/mailman/listinfo/graph-tool
