搜索资源列表
VB_BSF_example
- VB解决倒油问题: 设有容量为A,B,C三个无刻度的油桶,初始油量和需要分出的油量可根据需要设定。用广度优先搜索算法寻找一种最少的分油步骤(默认最多为9999步)。 -a VB BSF example
1438
- zju1438一道广度优先搜索题目,三维空间,陷阱很多。-You re in space. You want to get home. There are asteroids. You don t want to hit them. input Input to this problem will consist of a (non-empty) series of up to 100 data sets. Each data set will be formatted ac
sRtree
- 快速动态优先搜索树的实现Rapid implementation of dynamic priority search tr-Rapid implementation of dynamic priority search tree
tu
- 遍历算法在数据结构中是最普通的运算方法也是所有其它算法的基础。由于图的遍历比线性表、树的结构的遍历算法要复杂,因此着重对图的遍历算法进行讨论, 具有更普遍的意义。图的遍历就是从图中指定的某顶点作为遍历的起始出发点, 按照一定搜索遍历路径, 对图中所有顶点仅作一次访问的过程。 根据搜索路径方向的不同, 遍历图的方法可分深度优先搜索遍历和广度优先搜索遍历, 又根据编制算法的方法不同, 可分为递归遍历算法和非递归遍历算法。 -Data structure traversal algorithm
graph
- 用邻接表的方式建立一个图,可以对这个图进行删除边,增加边,删除增加节点,和深度广度优先搜索-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
huffman
- 构造哈夫曼树,应用深度优先与广度优先搜索……测试无误,欢迎交流-Huffman tree construction, application of depth first and breadth first search ... ... the test is correct, welcomed the exchange of
BFSN_Algorithm
- 本matlab函数是广度优先搜索邻居的聚类算法实现,仅供参考!-The matlab function is breadth-first search neighbor clustering algorithm for reference purposes only!
wireless
- 无线网络中的深度优先搜索算法,实现在无线网络中的节点的搜索-DFC in wireless network
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
1112
- POJ1112,动态规划,宽度优先搜索预处理-POJ1112, dynamic programming, breadth-first search for pre-
BFSforeightnumbers
- 人工智能完成的作业,用宽度优先搜索实现八数码问题,可以得到解的步数,生成的节点数和运行时间。-AI to complete the job, with the width of the first search for Eight digital problem solution steps can be generated nodes and run time.
ReArrayStyleBoxBoundedDepthSearch
- 使用有界深度优先搜索方法实现任意初始和终止状态的重排九宫格-Bounded depth-first search to achieve Style Box
BFS-v1.1
- 这是我写的人工智能的九宫问题,用广度优先搜索实现,效率不高。-This is my problem writing artificial intelligence Nine-palace, with breadth-first search to achieve efficiency is not high.
TSP00022304
- 基于广度优先搜索解决TSP问题,可以删除,添加边和节点-TSP based on breadth-first search to solve the problem, you can delete, add edges and nodes
DSFTraver
- 图的深度优先搜索遍历,可以实现数据结构中关于图的遍历里面的深度优先搜索遍历-Depth-first search graph traversal can be achieved on the graph data structure traversal inside the depth-first search traversal
1002
- 电子科大CDOJ第二题,很经典的搜索题, 解救小Q,这里使用广度优先搜索-failed to translate