搜索资源列表
Pailie
- 1~n的m排列问题 采用深度优先搜索解决此类问题-1 ~ n of the m permutation problem
AIprogram3
- 用c++语言实现井字棋的游戏,要求要用深度优先搜索的算法。-Written in c++ language realization, well character chess game with requires depth first search algorithm.
1080
- N皇后( 深度优先搜索 ) n=6-12-N Queens (depth first search) n = 6-12
guangheshenshousuo
- 图形的广度优先搜索及深度优先搜索,是个不错的参考资料-Breadth-first graph search and depth-first search, is a good reference
shanzhash
- 在人工智能领域,对隐式图的搜索是求解问题的一种基本方法,本程序通过使用多种图搜索策略,对 重排九宫问题进行求解,演示了“广度优先搜索”、“深度优先搜索”、“有界深度优先搜索”、 “最好优先搜索”和“局部择优搜索”五种基本的图图搜索策略。 整个程序使用了动画技术,界面设计美观友好,使用方便。-In the field of artificial intelligence, implicit graph search is a basic method of solving proble
ReArrayStyleBoxBoundedDepthSearch
- 使用有界深度优先搜索方法实现任意初始和终止状态的重排九宫格-Bounded depth-first search to achieve Style Box
DSFTraver
- 图的深度优先搜索遍历,可以实现数据结构中关于图的遍历里面的深度优先搜索遍历-Depth-first search graph traversal can be achieved on the graph data structure traversal inside the depth-first search traversal
Without-the-adjlink-to-map
- 从键盘输入无向图G的顶点个数v及边的个数e。建立有v个顶点、e条边构成的无向图G,采用邻接矩阵表示。V个顶点的值由键盘输入,元素类型为字符型。e条边的信息也由键盘输入。分别调用图的深度优先搜索、广度优先搜索图并输出相应的遍历序列。-Input from the keyboard without the number of vertices to the graph G v and the number of edges e. Establishment of a v vertices, e ed
017
- 广度优先搜索及深度优先搜索,用C语言实现,比较使用-Breadth-first search and depth first search, using C language, compared with
graph(linjiejuzhen)
- 基于C++模板,用邻接矩阵的方式,实现了基本的Graph(map)的构建,并实现了深度优先搜索和广度优先搜索,同时加入了测试用的数据读入和写入函数,便于调试和在本代码基础上进行进一步扩充。-Based on C++ templates, adjacency matrix, enabling a basic Graph (map) to build and achieve a depth-first search and breadth-first search, also joined the
dfs3
- 图的深度优先搜索算法,图的存储采用数组来模拟邻接表。-Graph depth-first search algorithm, Figure storage array used to simulate the adjacency table.
Sudoku-dengqiong
- 数独~~1、嵌套循环(最简单的行代码就解出来一个解) 2、深度优先搜索(将数独作为树节点,建立深度优先搜索树,也是只解一个解) 还有关于这个的设计~~~ -Sudoku- ~ 1, nested loops (the most simple lines of code out a solution on the solution) 2, depth-first search (to Sudoku as a tree node, to establish the depth-fi
8puzzle
- 利用深度优先搜索、广度优先搜索和启发式搜索解决8数码问题,效率各有不同-Use depth-first search, breadth-first search and heuristic search to solve 8 digital issues, different efficiency
Depth-first-search
- 深度优先搜索的搜索过程类似树的先序遍历,也叫回溯法。-Depth-first search of the search process similar to the preorder traversal of the tree, also known as backtracking.
Machines-Based-on-DFS
- 深度优先搜索的支持向量机参数优化算法 Study on Parameters Optimization of Support Vector Machines Based on DFS :研究支持向量机参数优化问题,由于算法要求准确选择 SVM 参数,支持向量机在处理大样本数据集时和最优模型参 数确定时,消耗的时间长、占有内存大,易获得局部最优解的难题。为了解决支持向量机存在的不足,采用深度优先搜索算 法对其参数优化机机制进行改进。将向量机参数优化视成一个组合优化问题,将支持向
Graph-traversal
- 图的遍历(含深度优先搜索与广度优先搜索,主函数)-Graph traversal (depth-first search and breadth-first search)
test2
- 数据结构 图的深度优先搜索遍历路径源代码-Data structure depth-first search through the source code path
mataqipan
- 深度优先搜索遍历地"马踏棋盘",代码实现-Depth-first search traversal to " horse riding board" , code
graph
- 图的深度优先搜索遍历算法分析及其应用.pdf-woyu buhuia
1
- 深度优先搜索算法及其改进.pdf 深度优先搜索算法及其改进.pdf-shen du you xian suan fa shen du you xian suan fa