It is mostly the reverse edge I have problem with. My graph is not necessarily a complete graph and therefore in my graph an reverse edge does not always exist. However I would like to introduce just when running the algorithm. I think I will need two graphs but maybe have a map between the edges which are cooresponding in both graphs. Thanks for your answer. Best regards Line On Dec 10, 2007 7:37 AM, Line B. Reinhardt wrote:

Dear All I would like some help with graph structure for the edmund_karp max flow min cut function. I have a general graph in which I have many properties + edge and vertex. I sould like to run edmund karp on this graph however I have not been able to make the structure right for edmund karp and therefore I have made a second graph a flow graph. However I do not want to copy edges over every time I change something in the original graph. I was wundering if I could make it the same graph or just make the flow graph a filteret version of the original graph. The graphs are defined as follows::

<snip> Hi Line, Can you explain what you mean by "have not been able to make the structure right"? Your original graph needs to have reversed edges (for every edge (u,v) in the graph, (v,u) needs to also be in the graph), but unless you're missing that, you should be able to avoid having to create a separate graph to pass in. If you are missing reversed edges, you won't be able to add them through a filtered graph - a filtered graph only lets you remove some set of vertices and/or edges from the graph. Regards, Aaron _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users