当前位置：
首页 资源下载
搜索资源 - Breadth First Search
搜索资源列表
-
0下载：
e: C# code tha implements the Breadth-first-search (BFS) search algorithm. The program solves the 8-puzzle game using the algorithm
-
-
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下载：
Breadth First Search code with C++,it s the code to build the project of Romania Road.
-
-
0下载：
匹配问题 - 匈牙利树算法 - 广度优先搜索BFS-Match- Hungary tree algorithm- breadth-first search BFS
-
-
0下载：
a program which performs breadth first search
-
-
0下载：
This the algorithm of BFS(breadth first search)- This is the algorithm of BFS(breadth first search)
-
-
0下载：
BFS(breadth first search)
-
-
0下载：
编程任务：
对于给定的树，以根结点为起点，对树实现非递归方式广度优先搜索，输出广度优
先搜索序列
数据输入：
由文件input.txt给出输入数据。第1行有1个正整数n，表示给定的二叉树有n个顶
点，编号为1，2，…，n。接下来的n行中，每行有3个正整数a,b,c，分别表示编号为a的结
点的左儿子结点编号为b，右儿子结点编号为c，0表示没有儿子。各结点信息按照层序列表
的顺序给出。-Programming tasks: For a given of t
-
-
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
-
-
0下载：
宽度优先搜索算法。使用java语言编写，很实用。-Breadth-first search algorithm. Using java language, very practical.
-
-
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下载：
9格宫数字进行排序，随机打乱顺序，可以完成0-8数字的正确排序，采用广度优先搜索进行遍历-9 palace digital sorting, random order, can be completed the correct sequence of 0 to 8 Numbers, traverse using breadth-first search
-
