On 01/13/2011 02:40 PM, jeremy wrote:
Thanks for the info Tiago, your suggestion appears to be working, although still evaluating whether the results are meaningful. I'm pretty much a newbie in the art of graph analysis so I appreciate your support.
I've committed a fixed for the directed check in the git version. I also modified the graph augmentation code which should make things faster for the kolmogorov method, since reversed edges which already exist are now detected and used.
I've found the push_relabel method to be unreliable, failing more often than not. But, the kolmogorov method seems to work every time.
This is interesting... Could you perhaps give me a short example where the push_relabel method fails and the kolmogorov method doesn't?
As this method is now showing as deprecated in the boost library will you be updating graph_tool to use the boykov_kolmogorov method?
Only the name of the method changed, not the algorithm itself... But now I also changed the name of the function to boykov_kolmogorov_max_flow() in graph-tool to reflect the change in boost (and also to be fair to Boykov :-). Cheers, Tiago -- Tiago de Paula Peixoto <tiago@skewed.de>