随笔分类 -  广度优先bfs

搜索专题训练【CSUST_Newer_12级入门】
摘要：搜索专题（Newer）题解：A bfs依次遍历周围的八个方向（马走日）B bfs注意记录当前方向和转弯数C bfs入门题目，注意要清空队列D dfs入门，周围加边四个方向深搜即可。E dfs.八连块问题 只要周围的八个方向的图是一样的，则都算是同一个八连块，记录共有多少个八连块即可。D dfs 深度遍历每一条路即可，只是要边遍历边记录路径，最后输出路径就好了E dfs+奇偶剪枝优化IDTitle13/19Problem AKnight Moves6/38Problem B逃离迷宫8/40Problem CCatch That Cow8/8Prob... 阅读全文
posted @ 2013-03-30 21:55 free斩 阅读(199) 评论(0) 推荐(0)
POJ 3278 Catch That Cow 【bfs+队列】
摘要：原题链接：http://poj.org/problem?id=3278算法：bfs+队列+STL（C++）PS：bfs入门题目，好高兴啊，终于会用bfs了。Catch That CowTime Limit:2000MSMemory Limit:65536KTotal Submissions:32679Accepted:10060DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a pointN(0 阅读全文
posted @ 2012-11-10 00:52 free斩 阅读(213) 评论(0) 推荐(0)
POJ 3278 Catch That Cow （bfs+队列）
摘要：原题链接：http://poj.org/problem?id=3278算法：bfs+队列+STL（C++）PS：bfs入门题目，好高兴啊，终于会用bfs了。Catch That CowTime Limit:2000MSMemory Limit:65536KTotal Submissions:32679Accepted:10060DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a pointN(0 阅读全文
posted @ 2012-11-10 00:52 free斩 阅读(217) 评论(0) 推荐(0)