BFS
亿念之茶
I'm a newbie,but i believe i could fly one day!
展开
-
深搜和广搜算法
深搜和广搜算法思想本文转载自:http://blog.csdn.net/bool_isprime/archive/2010/08/11/5803018.aspx深度优先搜索和广度优先搜索的深入讨论一、深度优先搜索的特点是: (1)从上面几个实例看出,可以用深度优先搜索的方法处理的题目是各种各样的。有的搜索深度是已知和固定的,如例题2-4,原创 2015-03-25 20:36:57 · 6108 阅读 · 0 评论 -
hdoj Asteroids! (BFS)
Asteroids!http://acm.hdu.edu.cn/showproblem.php?pid=1240Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3819 Accepted Submission(s):原创 2015-04-06 18:45:46 · 345 阅读 · 0 评论 -
poj 2251 Dungeon Master(BFS三维)
Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20912 Accepted: 8106点击打开链接DescriptionYou are trapped in a 3D dungeon and need to fin原创 2015-08-06 15:44:01 · 561 阅读 · 0 评论 -
hdoj 1728 逃离迷宫 (BFS)
逃离迷宫点击打开链接Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19568 Accepted Submission(s): 4756Problem Description 给定一个m ×原创 2015-08-07 16:22:39 · 714 阅读 · 0 评论 -
poj 3984 迷宫问题(BFS+回溯)
迷宫问题Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11256 Accepted: 6733点击打开链接Description定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0原创 2015-08-06 17:11:19 · 1671 阅读 · 0 评论 -
poj 3278 Catch That Cow(BFS)
Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 61200 Accepted: 19106DescriptionFarmer John has been informed of the location of a fugitiv原创 2015-08-06 10:20:49 · 516 阅读 · 0 评论 -
hdoj 1242 Rescue (BFS)
Rescuehttp://acm.hdu.edu.cn/showproblem.php?pid=1242Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18962 Accepted Submission(s): 677原创 2015-04-01 20:23:40 · 486 阅读 · 0 评论 -
Zoj 1671 Walking Ant(BFS+优先队列||记忆化搜索)
Walking AntTime Limit: 2 Seconds Memory Limit: 65536 KB点击打开链接Ants are quite diligent. They sometimes build their nests beneath flagstones.Here, an ant is walking in a rectangular are原创 2015-08-06 21:16:14 · 652 阅读 · 0 评论