From: Doug Gregor (dgregor_at_[hidden])
Date: 2005-05-02 10:39:41
On Apr 19, 2005, at 4:59 PM, Peter Billen wrote:
> I believe the required graph concepts of the Edmunds-Karp algorithm
> are not
> complete. The online documentation says the given graph has to be a
> VertexListGraph. I believe it also has to be a IncidenceGraph, since
> algorithm uses breadth-first search, which calls the out-edges of each
> successively. Since the algorithm (and all flow algorithms) work on
> the edges
> of the graph, edges are needed somewhere, so VertexListGraph cannot be
> in my opinion.
> Is this correct?
Yep, you're right. I've fixed the documentation in CVS. Thanks!
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk