
Boost : 
From: Peter Billen (peter_at_[hidden])
Date: 20050419 16:59:29
Hello all,
I believe the required graph concepts of the EdmundsKarp 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 the
algorithm uses breadthfirst search, which calls the outedges of each node
successively. Since the algorithm (and all flow algorithms) work on the edges
of the graph, edges are needed somewhere, so VertexListGraph cannot be enough
in my opinion.
Is this correct?
Thanks,
 Peter
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk