搜索资源列表
wuxiangtu4
- 无向图的宽度优先搜索 -Undirected graph in breadth-first search of undirected graph breadth-first search
C
- 深度优先搜索遍历, 数据结构 图的遍历,c 语言编写-Depth-first search traversal
3278
- poj 3278 Catch That Cow 采用广度优先搜索实现-poj 3278 Catch That Cow using breadth-first search to achieve
PegJump
- (1)、深度优先搜索。 (2)、可以点击面板上的按钮设置七种默认的初始状态。 (3)、点击“自定义”按钮可以自行设定初始状态。 (4)、设定初始状态后点击“搜索”按钮,启动搜索算法,若找到走法,则弹出对话框提示“已找到解”,接着点击“下一步”按钮,将走法一步步呈现出来,点击一下走一步;若找不到走法,则弹出对话框提示“未找到解”。 集成开发环境(IDE) Eclipse 3.3. JDK 5.0.1 注:系统安装的JDK必须是5.0以上的版本。-(1), depth-fir
guangdu
- 人工智能中的广度优先搜索算法,以八数码管为例进行编程实现-Artificial Intelligence in the breadth-first search algorithm, for example eight programmable digital control to achieve
83390079060624
- 设计程序完成如下功能:对给定的图结构和起点,产生所有的深度优先搜索遍历序列,并给出求解过程的动态演示。 说明:可以用实验工具中的有关功能。
shujujiegou
- 设计程序完成如下功能:对给定的图结构和起点,产生所有的深度优先搜索遍历序列,并给出求解过程的动态演示。 说明:可以用实验工具中的有关功能。
8_num
- 深度优先搜索八数码问题[VC++] 简单实用-Eight digital depth-first search problem [VC++] simple and practical
Poj_1011_sticks
- 由题意知道,本题就是根据题目给出的木棒,拼出长度最短的等长的棒子,本题主要应用了深度优先搜索+强剪枝。我们知道,肯定是先把小棒排序,从最大的开始枚举,然后如果到某一个长度时,满足条件,哪么就输出该长度。-George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the origi
eigthnum
- 宽度优先搜索算法八数码问题代码: 把起始节点放到OPEN表中(如果该起始节点为一目标节点,则求得一个解答)-Breadth-first search algorithm eight issues digital code: the start node on OPEN table (if the start node as a target node, then find an answer)
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
tu
- 实现了图的创建,深度优先搜索和广度优先搜索-To create a graph, depth-first search and breadth-first search
DFS
- 图论编程,包含文件操作,建立图的邻接表,并实现深度优先搜索-Graph theory programming, including file operations, the establishment of plans of the adjacent table, and the depth-first search
TASKS
- 限界剪枝法语回溯法类似,是一种在问题的状态空间树中搜索解的算法。优先级用优先队列来实现,优先级高即估计函数值越低的结点越靠近队列开头位置。-French back-Bound pruning method similar to the problem is a state-space search tree algorithm solution. Priority queue with priority to the realization of the high priority that i
guangduyouxiansuosou
- 此算法是广度优先搜索的算法实现,已通过测验。-This algorithm is a breadth-first search algorithm, has passed the test.
shenyou
- 求解数独的深度优先搜索的程序,没有递归,可用于低性能的单片机。-Sudoku Solving the depth-first search procedure, there is no recursion, can be used for low performance microcontroller.
main
- poj2676:sudoku.深度优先搜索和剪枝.正确程序.-poj2676:sudoku.Depth First Search.Accepted program.
DFSBFS
- 关于数据结构搜索方法中的深度优先搜索及广度优先搜索的算法及比较,c语言描述,简单易懂.-Search method on the data structure in the depth-first search and breadth-first search algorithm and comparison, c language to describe, easy to understand.
Graph
- 图的大部分实现 图的深度优先周游 图的广度优先周游 由队列方式实现的拓扑排序 由深度优先搜索方式实现的拓扑排序 单源最短路径(Dijkstra算法) 每对顶点之间的最短路径(Floyd算法) 最小支撑树(Prim算法) 最小支撑树(Kruskal算法)-Figure most of the implementation diagram of the depth-first breadth-first tour travel map be achieved by the topological s
MazeGames
- **迷宫游戏生成及最佳路径** 迷宫原理:把平面中的每个奇数坐标如:(1,3),(5,5)...设为节点,深度搜索每个节点并打通所有的路径行成随机迷宫. 最佳路径:从迷宫的入口点开始广度优先搜索每一个通道求得到达终点的最佳路径. -** Maze games maze generation and the best path** Principle: the plane coordinates of each odd-numbered, such as: (1,3), (5,5) .