Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
 Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

从源点遍历一遍, 如果一条边的一个点遍历过, 另一个点没有遍历过, 那这条边就是割

Posted by mmd at 2008-01-21 00:49:13
In Reply To:用最短增广路求出最大流，怎么输出一组对应的最小割啊？大牛们都怎么搞的？？ Posted by:Rainco at 2008-01-21 00:35:45 
> RT~~
Followed by:
Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator