From: Doug Gregor (dgregor_at_[hidden])
Date: 2004-11-11 14:35:19
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.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk