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 vince4053040 at 2010-03-31 16:34:47 on Problem 1101
In Reply To:BFS解法:直线扩展+当前最小连接段的优先队列,一旦找到目标点即是最少段连接 Posted by:micweaver at 2010-03-30 21:19:28


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