Re: [Boost-users] RBGL use with BGL minCut() function
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.
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.pdfhttp://www.corelab.ntua.gr/%7Esyrganis/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?
I won't be great help, but I can try to answer some questions about programming with the BGL. I'm still not entirely sure what you are trying to do however. It's probably worth pointing out that you don't actually need to link against the BGL. It is a header-only library, which means just #include'ing the relevant files will allow you to use them. Andrew Sutton andrew.n.sutton@gmail.com
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
On Fri, Jan 30, 2009 at 12:45:36PM -0500, Nick Edmonds wrote:
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.
He needs k-way cut, which is related to multicommodity flow problems. Max-flow algorithms compute only 2-way cut (indirectly; thanks to the max-flow, min-cut theorem).
participants (4)
-
Andrew Sutton -
Gianni Loiacono -
Nick Edmonds -
Zeljko Vrba