On 18.09.2014 21:46, ambasta wrote: > From what I understand of Dijkstras search, Dijkstras visitor is > invoked at traversal of a vertex. However, this is still separate from > the weights which is a required argument the algorithm takes. In my > case however, the weight of traversing the edge is a function of cost > of traversing to the edge from the origin vertex.
Read the documentation carefully. The visitor is invoked at several event points, one of which is "examine_edge", which is called before any edge is discovered by the algorithm. You can use this to set up the weights. This seems to be exactly what you want. Best, Tiago -- Tiago de Paula Peixoto <[email protected]> _______________________________________________ graph-tool mailing list [email protected] http://lists.skewed.de/mailman/listinfo/graph-tool
