搜索资源列表
kkkk
- 创建邻接表, 采用 广度遍历非递归 或 深度优先搜索
3126
- PKU 3126 典型的广度优先搜索 用队列实现
sudoku1
- 数独求解代码，用深度优先搜索数独问题的解，求得唯一解-Solving Sudoku code, using depth-first search solution Sudoku problem, find a unique solution
minop
- 最少运算问题 主要是深度优先搜索迭代加深的运用-At least the problem is that computing depth-first search Iterative deepening the use of
2946
- pku2946,宽度优先搜索，很好玩的一道题目呵呵，我第一次做这样的题，所以程序不是很完善-pku2946, breadth-first search, is a lot of fun together with the subject Oh, my first title to do this, so the procedure is not perfect
wuxiangtu3
- 无向图的深度优先搜索 无向图的深度优先搜索 无向图的深度优先搜索 -Undirected graph depth-first search of undirected graph depth-first search of undirected graph depth-first search of undirected graph depth-first search of undirected graph of the depth-first search
wuxiangtu4
- 无向图的宽度优先搜索 -Undirected graph in breadth-first search of undirected graph breadth-first search
square
- 给你n根木棒，请问使用这些木棒，是否有可能让它们头尾相连组成一个正方形？所 有的木棒都必须使用。 深度优先搜索的正方形问题-N root stick to you, will use the stick, is it possible so that they linked to the formation of a square head? All must use the stick. Depth-first search of the square problem
Savage_with_plans_to_cross_the_river_breadth_first
- 关于野人过河问题中的程序设计，包括用图的广度优先搜索算法-Across the river on the Savage program design issues, including breadth-first graph search algorithm
guangduyouxiansuosou
- 此算法是广度优先搜索的算法实现，已通过测验。-This algorithm is a breadth-first search algorithm, has passed the test.
main
- poj2676:sudoku.深度优先搜索和剪枝.正确程序.-poj2676:sudoku.Depth First Search.Accepted program.
1
- 1.建立一个无向图的邻接表存储 2。对该图进行深度优先搜索，按顺序输出所访问的-1. The establishment of an undirected graph in adjacency list is stored 2. Depth-first search of the graph, according to the order of the output of the visit
AIDFS
- 实现C#深度优先搜索七巧板程序,完成七巧板深度优先搜索的解答，算法对固定图效果还好-depth first search DFS AI
The-biggest-Black-Area
- 求解最大连通区域 一个简单的广度优先搜索算法-Solving the biggest connected region with a simple breadth-first search algorithm
mataqipan
- 深度优先搜索遍历地"马踏棋盘"，代码实现-Depth-first search traversal to " horse riding board" , code
NwebCrawler
- NwebCrawler是用C#写的一款多线程网络爬虫程序，它的实现原理是先输入一个或多个种子URL到队列中，然后从队列中提取URL（先进先出原则），分析此网页寻找相应标签并获得其href属性值，爬取有用的链接网页并存入网页库中，其中用爬取历史来记录爬过的网页，这样避免了重复爬取。提取URL存入队列中，进行下一轮爬取。所以NwebCrawler的搜索策略为广度优先搜索。采用广度优先策略有利于多个线程并行爬取而且抓取的封闭性很强。-NwebCrawler is a multi-threaded w
3126
- PKU 3126典型的广度优先搜索用队列实现-PKU 3126 typical breadth-first search using queue realize
3278
- poj 3278 Catch That Cow采用广度优先搜索实现-poj 3278 Catch That Cow using breadth-first search to achieve
mataqipan
- 深度优先搜索遍历地"马踏棋盘"，代码实现-Depth-first search traversal to " horse riding board" , code
3126
- PKU 3126典型的广度优先搜索用队列实现-PKU 3126 typical breadth-first search using queue realize