搜索资源列表
-
0下载:
解决八数码问题的广度优先搜索的源代码,编程语言为C-Solve the problem of eight digital breadth first search source code.For c++ programming language
-
-
0下载:
八数码问题也称为九宫问题。在3×3的棋盘,摆有八个棋子,每个棋子上标有1至8的某一数字,不同棋子上标的数字不相同。棋盘上还有一个空格,与空格相邻的棋子可以移到空格中。要求解决的问题是:给出一个初始状态和一个目标状态,找出一种从初始转变成目标状态的移动棋子步数最少的移动步骤。所谓问题的一个状态就是棋子在棋盘上的一种摆法。棋子移动后,状态就会发生改变。解八数码问题实际上就是找出从初始状态到达目标状态所经过的一系列中间过渡状态。
八数码问题一般使用搜索法来解。搜索法有广度优先搜索法、深度优先搜索法
-
-
0下载:
能够输入输出一个图的邻接矩阵,能够对相应的边和顶点进行插入删除操作,能够进行深度和广度优先搜索遍历-The adjacency matrix of a graph can be input and output, insertion and deletion operations to the corresponding edges and vertices, depth and breadth-first search traversal
-
-
0下载:
C语言程序 算法设计 人肉搜索之宽度优先搜索算法-C language programming algorithm design of the human flesh search breadth-first search algorithm
-
-
0下载:
NwebCrawler是用C#写的一款多线程网络爬虫程序,它的实现原理是先输入一个或多个种子URL到队列中,然后从队列中提取URL(先进先出原则),分析此网页寻找相应标签并获得其href属性值,爬取有用的链接网页并存入网页库中,其中用爬取历史来记录爬过的网页,这样避免了重复爬取。提取URL存入队列中,进行下一轮爬取。所以NwebCrawler的搜索策略为广度优先搜索。采用广度优先策略有利于多个线程并行爬取而且抓取的封闭性很强。-NwebCrawler is a multi-threaded w
-
-
0下载:
e: C# code tha implements the Breadth-first-search (BFS) search algorithm. The program solves the 8-puzzle game using the algorithm
-
-
0下载:
city block breadth first search-breadth first search
-
-
0下载:
匹配问题 - 匈牙利树算法 - 广度优先搜索BFS-Match- Hungary tree algorithm- breadth-first search BFS
-
-
0下载:
a program which performs breadth first search
-
-
0下载:
这是关于图的链接表的深度优先和广度优先搜索的完整代码,希望能给广大的数据结构初学者一点帮助。-This is on the map linked table depth-first and breadth-first search the complete code, hoping to give the majority of the data structures that can help beginners.
-
-
0下载:
Curently five algorithms are included:
1. A* (using Manhattan distance)
2. A* (using Euclidean distance)
3. A* (using Chebyshev distance)
4. Dijkstra
5. Bi-Directional Breadth-First-Search- Curently five algorithms are included:
-
-
0下载:
宽度优先搜索,1215. 脱离地牢,改编一下。年轻的王子Paris与美丽的公主Helen被困在地牢里,他们想知道能否找到对方。-Breadth-first search, 1215 from the dungeon, adapted it. The young prince and the beautiful princess Helen Paris trapped in a dungeon, they want to know we can find each other.
-
-
0下载:
1.有向图的邻接表的建立,以及拓扑排序2.无向图邻接矩阵的建立,及其深度优先搜索和广度优先搜索-1 directed graph adjacency table creation, as well as topological sorting 2. Undirected graph adjacency matrix creation, and its depth-first search and breadth-first search
-
-
1下载:
Cutpicture(form)做的是直方图统计:
第一步:读入图片,并将彩色图片用公式转化为灰度图像。
第二步:用区域生长法将图片分块并对每一块做直方图统计,用广度优先搜索完成,子程序是int flood_fill()。返回值是区域内的点的数量。判断是否属于同一块区域的条件是前面搜索得到的灰度平均值是否大于给定阈值(即threshold,由用户输入决定)。
第三步:任意两块区域对区域直方图的每个色阶比例的差的绝对值求和,若和小于阈值(即threshold2,由用户输入决定)则合并两
-
-
0下载:
手动输入数据建立图,并对图进行深度优先搜索和广度优先搜索-Enter the data manually created maps and diagrams depth-first search and breadth-first search
-
-
0下载:
利用邻接矩阵或邻接表存储一张图,分别采用图的深度优先搜索和广度优先搜索遍历该图,并输出遍历结果-Using the adjacency matrix or adjacency list storage a picture, using depth-first search and the breadth first search traversal of the graph, and the output traversal results
-
-
0下载:
八数码问题的解决,包括三种路径的查找最优解,例如:深度优先查找,广度优先查找。-Eight digital problem solving, including three kinds of paths to find an optimal solution, for example: depth-first search, breadth-first search.
-
-
0下载:
用宽度优先搜索算法实现Bloxorz小游戏的最优化,是一种数学建模方法-With a breadth-first search algorithm to achieve optimal Bloxorz game, is a mathematical modeling approach
-
-
0下载:
广度优先搜索和深度优先搜索在网络拓扑图上的实现。广度优先搜索是从某一节点开始,搜索与其线连接的所有节点,按照广度方向像外扩展,直到不重复遍历所有节点;深度优先搜索是从某一节点开始,沿着其搜索到的第一个节点不断深入下去,当无法再深入的时候,回溯节点,然后再在回溯中的某一节点开始沿另一个方向深度搜索,直到不重复的遍历所有节点。
-Breadth-first search and depth-first search in the network topology is realized. Bre
-
-
0下载:
PKU 3126典型的广度优先搜索用队列实现-PKU 3126 typical breadth-first search using queue realize
-