![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
dfs
文章平均质量分 81
evi1743
这个作者很懒,什么都没留下…
展开
-
hdu -1241 Oil Deposits
Oil DepositsProblem DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time,原创 2013-08-14 10:40:32 · 462 阅读 · 0 评论 -
SDJZ 迷宫问题
题目描述小明置身于一个迷宫,请你帮小明找出从起点到终点的最短路程。小明只能向上下左右四个方向移动。输入格式输入包含多组测试数据。输入的第一行是一个整数T,表示有T组测试数据。每组输入的第一行是两个整数N和M(1接下来N行,每行输入M个字符,每个字符表示迷宫中的一个小方格。字符的含义如下:‘S’:起点‘E’:终点‘-’:空地,可以通过‘#’:障碍,无法原创 2013-08-18 19:30:23 · 711 阅读 · 0 评论 -
Prime Ring Problem
Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22545 Accepted Submission(s): 10033Problem DescriptionA rin原创 2014-02-07 16:18:13 · 426 阅读 · 0 评论 -
Ignatius and the Princess I
Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10658 Accepted Submission(s): 3243Special JudgeProblem原创 2014-02-07 16:28:45 · 480 阅读 · 0 评论 -
BFS DFS
广度优先搜索(Breadth-First-Search)和深度优先搜索(Deep-First-Search)是搜索策略中最经常用到的两种方法,特别常用于图的搜索.其中有很多的算法都用到了这两种思想,比如:Dijkstra单源最短路径算法和Prim最小生成树算法都采用了和宽度优先搜索类似的思想。BFS的思想:从一个图的某一个顶点V0出发,首先访问和V0相邻的且未被访问过的顶点V1、V2、转载 2014-02-20 18:30:36 · 731 阅读 · 0 评论 -
变形课
变形课Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 11305 Accepted Submission(s): 4177Problem Description呃......变形课上Harry碰到了一原创 2014-02-09 21:12:59 · 616 阅读 · 0 评论 -
poj1016 Prime Ring Problem---dfs
Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22718 Accepted Submission(s): 10116Problem DescriptionA ring原创 2014-02-20 15:56:42 · 519 阅读 · 0 评论