On Jan 29, 2009, at 1:22 PM, Gianni Loiacono wrote:
Hi Mr. Sutton thanks for the answer. I didn't know what was **R :-D**. Now I have readed some links and I have understand that RBGL is not adapt for my project (into the file zip Win Binary I have seen a ..dll file than I thought that I could use more libraries :)). My goal is to do multi minimum cuts (gomory hu tree algorithm: http://www.corelab.ntua.gr/~syrganis/sources/Gomory-Hu.pdf ). The min-cut BGL functions give out only the min-cut value, I want to know what edges were cut. Can you help me?
Sorry for my english ;/ Thanks a lot for your time and for the help. Bye.
The min cut may not necessarily be unique, do you care about all the possible edge sets that compose a min-cut, or only one of them? You can use the color map in kolmogorov_max_flow to determine the min cut found by the algorithm, but as mentioned, it may not be unique. Hope that helps, Nick
_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users