当前位置:
首页
资源下载
![](/images/right.gif)
搜索资源 - Breadth First Search
搜索资源列表
-
0下载:
breadth-first search
-
-
0下载:
Breadth first search and Depth first search
-
-
1下载:
八数码拼图游戏的求解程序,通过双向广度优先搜索算法,输出最优解的路径.-Eight digital jigsaw puzzle solving process, through bi-directional breadth-first search algorithm, the optimal solution output path.
-
-
0下载:
8数码问题的解决方案,宽度优先搜索,和广度优先搜索,可以通过修改期中的全局值,可以适应任何维度的搜索-8 digital solution to the problem, breadth-first search, and breadth-first search, you can modify the period of global value, can adapt to any dimension of the search
-
-
2下载:
能够建立有向图无向图的邻接矩阵和邻接表表示法,深度优先和广度优先搜索,能够存储和显示相应的搜索结果(深度优先或广度优先生成森林(或生成树)、深度优先或广度优先序列和编号)。以文件形式输入图的顶点和边,并显示相应的结果。-To build a directed graph undirected adjacency matrix and adjacency list representation, depth-first and breadth-first search, to store and
-
-
0下载:
对任意给定的图(顶点数和边数自定),建立它的邻接表并输出,然后利用堆栈的五种基本运算(清空堆栈、压栈、弹出、取栈顶元素、判栈空)实现图的深度优先搜索遍历和广度优先搜索遍历算法。
-For any given graph (vertices and edges from the set), to establish its adjacency list and output, and then use the stack of five basic operations (empty stac
-
-
0下载:
人工智能课程设计,关于广度优先搜索的一个实例-Artificial intelligence curriculum design, breadth-first search on an instance of
-
-
0下载:
搜索算法的示例 采用广度优先搜索算法 代码示例 八皇后问题-Examples of search algorithm using breadth-first search algorithm code sample eight queens problem
-
-
0下载:
一个简单的九宫格游戏,只要能在25步内走完的,可以进行广度优先搜索的计算,权当进入.net领域练手的一个小游戏开发-JiuGongGe, a simple game, as long as the finish in 25 steps, the breadth-first search can be calculated
-
-
0下载:
数据结构中基本的广度优先搜索,使用语言为C语言。-The basic data structure breadth-first search, the use of language is C language.
-
-
0下载:
求解八数码问题,人工智能经典算法。使用A*,A,宽度优先搜索三种算法实现,并进行比较。大三人工智能作业-AI algorithm。A*,A,breadth-first
search algorithm。
-
-
0下载:
求解八数码问题,人工智能经典算法。使用A*,A,宽度优先搜索三种算法实现,并进行比较。大三人工智能作业-AI algorithm。A*,A,breadth-first
search algorithm。
-
-
0下载:
遍历算法在数据结构中是最普通的运算方法也是所有其它算法的基础。由于图的遍历比线性表、树的结构的遍历算法要复杂,因此着重对图的遍历算法进行讨论, 具有更普遍的意义。图的遍历就是从图中指定的某顶点作为遍历的起始出发点, 按照一定搜索遍历路径, 对图中所有顶点仅作一次访问的过程。
根据搜索路径方向的不同, 遍历图的方法可分深度优先搜索遍历和广度优先搜索遍历, 又根据编制算法的方法不同, 可分为递归遍历算法和非递归遍历算法。
-Data structure traversal algorithm
-
-
0下载:
用邻接表的方式建立一个图,可以对这个图进行删除边,增加边,删除增加节点,和深度广度优先搜索-With the adjacency list of ways to build a map, you can delete the edges of this graph, increasing side, remove the added nodes, and depth of breadth-first search
-
-
0下载:
构造哈夫曼树,应用深度优先与广度优先搜索……测试无误,欢迎交流-Huffman tree construction, application of depth first and breadth first search ... ... the test is correct, welcomed the exchange of
-
-
0下载:
In graph theory, breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it finds
-
-
0下载:
本matlab函数是广度优先搜索邻居的聚类算法实现,仅供参考!-The matlab function is breadth-first search neighbor clustering algorithm for reference purposes only!
-
-
0下载:
分支界限法是由“分支”和“界限”策略两个部分组成,其中“分支”策略是对问题空间按照广度优先的策略进行搜索;“限界”策略是为了加速搜索速度而采用启发信息剪枝的策略。
使用分支限界法来解决单源最短路径问题时主要利用结点控制关系剪枝,在一般情况下,如果解空间树中以结点Y为根的子树中所含的解优于以结点X为根的子树中所含的解,则结点Y控制了结点X,以被控制的结点X为根的子树可以剪去。算法实现时,使用邻接矩阵表示图,二维数组存储图的邻接矩阵,使用数组记录源到各顶点的距离和路径上的前驱顶点。
-Br
-
-
0下载:
The basis of branch and bound algorithms is a ranking function. The ranking function assigns a value to each node in the graph. At each step, a branch and bound algorithm uses the ranking function to decide which node to expand next. In contrast, the
-
-
0下载:
8 puzzle using Breadth first search implemented by java. for atificial intellegence codes .
-
«
1
2
3
4
5
67
8
9
10
11
...
15
»