|
|
|
|
|
|
|
复制本帖HTML代码
|
|
高亮:
今天贴
X 昨天贴
X 前天贴
X |
for each node v
perform a maximal flow between v and 0 to obtain the minimal cut (=mc);
set the key of v to mc and insert it into a Fibonacci heap h;
end
while(true)
v = h.extract_min(); (based on the key)
remove v and all edges incident on v;
if(node 1 is disconnected from node 0)
return v.key;
end
end.
|
| 欢迎来到华新中文网，踊跃发帖是支持我们的最好方法! |
|
|
－
－