C++博客-<p style="align:center; color:Green">Flying in the sky.</p>http://www.cppblog.com/imky/<p style="color:Blue"><b><big>----imky</b></p> zh-cnTue, 14 Apr 2026 23:06:47 GMTTue, 14 Apr 2026 23:06:47 GMT60无向图最小点割集解法http://www.cppblog.com/imky/archive/2010/08/14/123414.htmlimkyimkySat, 14 Aug 2010 02:54:00 GMThttp://www.cppblog.com/imky/archive/2010/08/14/123414.htmlhttp://www.cppblog.com/imky/comments/123414.htmlhttp://www.cppblog.com/imky/archive/2010/08/14/123414.html#Feedback0http://www.cppblog.com/imky/comments/commentRss/123414.htmlhttp://www.cppblog.com/imky/services/trackbacks/123414.html  无向图最小点割集，确定起点S，终点T。每个点都有自己的点权值vi，求最小点权和的割点集，使得S无法到达T。
       解法：将每个点拆分为两个点v和v'，之间的权值为vi，将原图中的每条边赋权值为INF（无穷大），然后使用最大流算法，求从S到T的最大流，即对应了最小割，其中割边集连接的点形成的点集就是最小点割集。
Code



imky 2010-08-14 10:54 发表评论
]]>hdu acm Battle 最大权闭包 3061http://www.cppblog.com/imky/archive/2010/08/09/122725.htmlimkyimkyMon, 09 Aug 2010 00:12:00 GMThttp://www.cppblog.com/imky/archive/2010/08/09/122725.htmlhttp://www.cppblog.com/imky/comments/122725.htmlhttp://www.cppblog.com/imky/archive/2010/08/09/122725.html#Feedback0http://www.cppblog.com/imky/comments/commentRss/122725.htmlhttp://www.cppblog.com/imky/services/trackbacks/122725.html阅读全文

imky 2010-08-09 08:12 发表评论
]]>