搜索资源列表
-
0下载：
Win32下立体迷宫程序，含自动求解，可求迷宫最短路径和所有路径，分别用广度优先搜索和深度优先搜索两种方法实现，欢迎讨论。-Win32 three-dimensional maze procedure, including automatic solution Stepping maze shortest path and all trails. priorities were used to search breadth and depth-first search in two ways,
-
-
0下载：
Implemented BFS, DFS and A*
To compile this project, use the following command:
g++ -o search main.cpp
Then you can run it:
./search
The input is loaded from a input file in.txt
Here is the format of the input file:
The firs
-
-
1下载：
通用二叉搜索树，包含的算法有：输出广度优先遍历、前序、中序、后序遍历结果，按树的形状打印树，统计总节点数，统计叶子节点数，统计右节点数，计算树的高度，删除所有叶子节点，插入节点，查找节点，删除节点，由前序遍历结果和中序遍历结果生成树，由后序遍历结果和中序遍历结果生成树，检查该树是否平衡和完全平衡。-generic binary search tree contains the algorithm are : output breadth - first traversal, the former
-
-
0下载：
载入txt文件迷宫,含几种搜索方法,例如depth first search, breadth first search等-TXT file loaded maze, including several search methods, such as the depth first search and breadth first search, etc
-
-
2下载：
广度优先搜索是从某一节点开始，搜索与其线连接的所有节点，按照广度方向像外扩展，直到不重复遍历所有节点。
深度优先搜索是从某一节点开始，沿着其搜索到的第一个节点不断深入下去，当无法再深入的时候，回溯节点，然后再在回溯中的某一节点开始沿另一个方向深度搜索，直到不重复的遍历所有节点。(Breadth first search begins with a node and searches all nodes connected to its line, extending in the direct
-
-
0下载：
The data structure breadth-first search maze the short circuit
-
-
0下载：
泊松分酒问题的一般解 用BFS进行广度优先搜索 实现简单(The general solution of Poisson's wine problem is implemented by BFS, which is simple in breadth first search)
-
-
0下载：
code for breadth first search - bfs
-
-
0下载：
data structure广度优先搜索实现迷宫最短路(The data structure breadth-first search maze the short circuit)
-
-
0下载：
载入txt文件迷宫,含几种搜索方法,例如depth first search, breadth first search等()
-
-
0下载：
实现广度优先搜索 深度优先搜索 以及 A星算法(Breadth first search, depth first search, and A star algorithm.)
-
-
0下载：
bfs floodfill
Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a 'search key') and explores the neighbor nod
-
-
0下载：
We use breadth-first search to find the shortest path. We additionally expect the path to be as straight as possible so there will be less scattered empty points on the map, which will improve the AI's success rate.
The image below illustrates how
-
-
0下载：
本题编写程序模拟人进行连连看游戏，电脑模拟人玩连连看的过程如下：
1、分析本局游戏，将本局游戏转化成一个二位数组。0表示空白区域，数字表示该游戏牌为出现在游戏中的第几类游戏牌。
2、利用广度优先搜索算法，判断两个游戏牌是否可以消除。
3、程序模拟人点击可以消除的一对游戏牌进行消除。
对某局游戏转化成二维数组如下：
0 0 0 0 0
0 1 2 0 0
0 0 3 4 0
0 0 0 1 0
输入二位数组的行、列，二位数组、起始元素的的坐标、终止元素的坐标，判断起始游戏牌
-
-
0下载：
载入txt文件迷宫,含几种搜索方法,例如depth first search, breadth first search等()
-
-
0下载：
深度优先搜索和广度优先搜索的代码....(Depth search breadth first search)
-
-
0下载：
本文件包含最小生成树程序，深度优先搜索，广度优先搜索，prim算法等，满足对树状图学习的小伙伴们下载，绝对是良心推荐，可以直接运行程序。(This file contains minimum spanning tree program, depth first search, breadth first search, PRIM algorithm, etc., which satisfies the downloads of tree learning partners. It is abso
-
-
0下载：
这是一份广度优先搜索的代码，代码很简单，很容易就能理解广搜的核心。(This is a breadth first search algorithm, the code is very short, it is easy to understand the core of Guang search.)
-
-
1下载：
输入或存储任意一个无向图，显示图的深度优先搜索遍历路径和广度优先搜索遍历路径。
要求：
1）基于图的邻接表存储结构实现。
2）基于图的邻接矩阵存储结构实现。(Input or store any undirected graph to show the depth first search traversal path and breadth first search traversal path of the graph
Requirement
1 the implement
-
-
1下载：
八数码 深度优先搜索 广度优先搜索 图搜索策略(eightpuzzle
Eight digital depth first search, breadth first search graph search strategy)
-
«
1
2
...
7
8
9
10
11
1213
»
