From: Peter Billen (peter_at_[hidden])
Date: 2005-04-19 16:59:29
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 the
algorithm uses breadth-first search, which calls the out-edges 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?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk