From: Doug Gregor (dgregor_at_[hidden])
Date: 2007-06-11 14:36:21
On Jun 11, 2007, at 10:49 AM, ANDREEA Picu wrote:
> I'm trying to use the boost graph library and I have a little problem
> with its implementation of Dijkstra.
> dijkstra_shortest_paths throws a negative_edge exception and I _do
> not_ have any negative edge in my graph (checked it both when I add
> the edges and their weights to the graph and by iterating through the
> edges once I finish constructing it).
> Did anyone have a similar problem?
I've never seen this before. Which version of Boost are you using,
and what is the edge weight that it is classifying as negative?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk