Re: [boost] [graph] bellman_ford_shortest_paths interface

11 Nov 2004


      On Nov 11, 2004, at 1:47 PM, Doug Gregor wrote:
...
One alternative would be to have:
template <class VertexAndEdgeListGraph, class P, class T, class R>
bool bellman_ford_shortest_paths(
           VertexAndEdgeListGraph& g,
           const bgl_named_params<P, T, R>& params = all defaults);
Where the mandatory named parameter start_vertex(u) indicates that we 
should initialize the property maps appropriately for starting at 
vertex u, and requires a VertexAndEdgeListGraph. This is the safe 
answer, at least.
I meant "root_vertex", not "start_vertex", here. Anyway, I've 
implemented this option and checked it into CVS head.

	Doug