搜索资源列表
深度优先搜索详解,附代码
- 详解,可以解决所有的深搜问题
分支定界求解TSP问题
- 分支限界法求解TSP问题[15] 分支限界法类又称为剪枝限界法或分支定界法,它类似于回溯法,也是一种在问题的解空间树T上搜索问题解的算法。它与回溯法有两点不同:①回溯法只通过约束条件剪去非可行解,而分支限界法不仅通过约束条件,而且通过目标函数的限界来减少无效搜索,也就是剪掉了某些不包含最优解的可行解。②在解空间树上的搜索方式也不相同。回溯法以深度优先的方式搜索解空间树,而分支限界法则以广度优先或以最小耗费优先的方式搜索解空间树。分支限界法的搜索策略是:在扩展结点处,先生成其所有的儿子结点(分支
人工智能经典问题八数码三种算法
- 人工智能经典问题八数码三种算法(广度优先搜索,深度优先搜索,启发式搜索)带有图形界面的解决方案。-Classic problem in Artificial Intelligence eight digital three algorithms (breadth-first search, depth-first search, heuristic search) with a graphical interface solutions.
migong.rar
- 关于数据结构的课程设计:迷宫问题,提供了广度优先和深度优先两种算法。,On the data structure of curriculum design: the maze problem, provides a breadth-first and depth-first two algorithms.
c.zip
- 以邻接多重表为存储结构,实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点,分别输出各种遍历下的结点访问序列和相应生成树的边集,To the adjacent multi-table for the storage structure, to achieve connectivity of undirected graph depth-first and breadth-first traversal. To user-specified node as a starting poi
DFS.rar
- 深度优先算法,用深度优先来遍历树结构,能够取得很好的复杂度,Depth-first algorithm, using depth-first traversal tree structure to achieve a good complexity
PBFSandDFS
- 对与数据结构中有向图采用邻接矩阵为存储结构实现有向图建立、深度优先遍历和广度优先遍历、并带有图片测试数据 可运行-And the data structure of a directed graph with adjacency matrix storage structure established to achieve a directed graph, depth-first traversal and breadth-first traversal, and test data can
tubianli
- 以邻接多重表为存储结构,实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点,分别输出每种遍历下的结点访问序列和相应生成树的边集。-To adjacent multi-table storage structure for connectivity undirected graph depth-first and breadth-first traversal. User-specified node as a starting point, respectively, under t
Java
- jbuilder2006下做的一个JAVA八数码问题的解法,注意采用了深度优先算法-jbuilder2006 done under a JAVA Problem eight digital, pay attention to depth-first algorithm using
Maze32
- 用C实现的迷宫求解算法。图形界面,求解过程参照了深度优先搜索,迷宫由随即矩阵生成,采用栈作为路径存储结构-Implemented in C maze solving algorithm. Graphical interface, the solution process with reference to the depth-first search, then the matrix generated by the maze, using the stack as the storage st
guohewenti
- 试运用深度优先搜索算法寻找过河问题的一个解决方案,题目叙述如下:猎人、狗、男人带着男孩1、男孩2,女人带着女孩1、女孩2,一共8个个体。一艘小船,一次只能过两个个体,狗和四个小孩不会划船。注意:(1)猎人不在,狗咬任何人;(2)男人不在,女人打男孩;(3)女人不在,男人打女孩。-Test the use of depth-first search algorithm to find a solution to cross the river problem, topics are describ
TU.rar
- 邻结表存储的无向图的建立及遍历输出(包括深度优先与广度优先搜索), The neighbour ties the table to save non- (first first searches to the chart establishment and the calendar output including depth with breadth)
xiaoyuandaohang
- 这是一个学校的校园导航系统,运用了图这种数据结构,采用了深度优先遍历,最小生成树等算法。-This is a navigational system of a school!
Sudoku
- 解数独的源码,使用深度优先搜索解决,有可视化的界面,能够很快的解出数独存在的一组解-Sudoku source, using the depth-first search
Chess(8puzzle)
- 这个程序是从广度优先搜索,深度优先搜索,A算法以及A算法等多方面算法来解决八数码问题.zip-8-puzzle A* BFS DFS MFC
data_struct7
- 数据结构课后设计题第七章 7.22③ 试基于图的深度优先搜索策略写一算法, 判别以邻接表方式存储的有向图中是否存在由顶 点vi到顶点vj的路径(i≠j)。 注意:算法中涉及 的图的基本操作必须在此存储结构上实现。 实现下列函数: Status DfsReachable(ALGraph g, int i, int j) -Data structure design question after class Chapter 7.22 ③ test graph-b
bashuma
- 分别用深度优先和广度优先来算八数码问题,c++源码-Were depth-first and breadth of the priority issues to count eight digital, c++ source code
DFSforeightnumbers
- 人工智能完成的作业,利用深度优先遍历实现八数码问题,可以设置搜索的深度,计算生成的节点数目。-AI to complete the job, using depth-first traversal for Eight digital problem, you can set the search depth, calculate the number of nodes generated.
8Digit
- 使用了A*,A,深度优先,宽度优先等算法解决八数码,由于高强度的优化,使得运算十分之快,而且功能齐全,界面好看.是上学期俺做的人工智能作业.-The use of A*, A, depth-first, breadth-first algorithm to solve, such as eight digital, high-intensity as a result of the optimization, making a very fast operation, and full-feat
15shuma
- 用宽度优先 深度优先 启发式算法求解15数码问题-sorry