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?

On Mon, Nov 17, 2014 at 7:13 PM, Tiago Peixoto [via Main discussion list for the graph-tool project] <[hidden email]> wrote:

On 17.11.2014 10:31, ambasta wrote:
> Since only a single argument u(edge) is passed, I am unable to
> retrieve the cost at the visitor attempting to travel via this edge.

Just store a property map with costs, and query it using u.source().

Best,
Tiago

--
Tiago de Paula Peixoto <[hidden email]>

_______________________________________________
graph-tool mailing list
[hidden email]
http://lists.skewed.de/mailman/listinfo/graph-tool

signature.asc (836 bytes) Download Attachment

--
Tiago de Paula Peixoto <[hidden email]>

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/Using-a-EdgePropertyMap-object-as-weights-tp4025744p4025851.html

To unsubscribe from Using a EdgePropertyMap('object') as weights, click here.
NAML

Ameno dom, Domi ne reo
Amit