搜索资源列表
图论
- BFS、DFS、有向图、无向图中的各种算法的实现,可以自动生成图形。-BFS, DFS, to the map, no map to the realization of the algorithm can be automatically generated graphics.
Eidffakght
- 利用BFS算法解八数码问题 在3*3的方格上放着1-8数码,有一空格为0变化规则为空格可以和上,下,右,左四个相邻的数字互换, 至到和目标状态相等, 每一种状态用一个结点表示 而每个结点每次变化最多有四种结点,将这些结点依次入队列中, 例如初始结点S0,入队列后出队,将S0变化最多产生的四种结点S01,S02,S03,S04依次入队列中, 当S01出队后,产生的四种结点S11,S12,S13,S14(实际上不会有四种结点)依次入队, 每次出队时与结束结点相比较,如果
多变量寻优
- 多变量寻优的源码,包括基本算法如下:DFP法(又称变尺度法),BFS法、一阶梯度法,共扼梯度法。-multivariate optimization of the source code, including basic algorithm is as follows : DFP Act (also known as the variable scale), BFS, a ladder degrees, a total of the accused gradient method.
prayer
- 野人传教士问题的一种简单实现方法,用的是标准模板库实现的BFS-Savage missionaries of a simple method, using the standard template library of the BFS
1229_bfs
- n个石头(每相邻两个的距离是1米,最边上石头和岸的距离也是1米),礼物放在第m个石头上,青蛙第i次跳2*i-1米.问能否得到礼物.(n>=49肯定能得到礼物,n<49,可以bfs或递归)-n stones (each of the two adjacent distance of a meter, the most edge of the rocks and the shore is a distance meters), gifts m on the first stone, th
AIbashuma
- 我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个\"扩展数组[4]\"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient
AIbashumaJava1
- 我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个\"扩展数组[4]\"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient
BFS11223
- 该程序实现了 无向图的建立和广度优先搜索及输出-the program no plans to the establishment and BFS and output
BFS_DFS_Astar
- Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The firs
wide_search
- 广度优先搜索 c语言实现-BFS c Language
bfs
- 宽度优先算法解决八码难题-width priority code algorithm to solve eight problems
1136
- zoj 1136题。 BFS搜索+同余求解
18BFS
- VC++实现广度优先遍历,BFS算法,属于数据结构习题
BFS
- java环境下采用广度优先搜索来求解8-puzzle、8-queen等智能问题 -By using BFS java environment to solve the 8-puzzle, 8-queen, intelligent problem
BFS
- 递归版本的广度优先算法的c++实现,包含邻接表存储有向图的类和测试程序。-c++ version of BFS .
bfs
- breadth first search
BFS-algorithm-matlab
- 前推回代算法matlab代码,在计算电力系统无功优化时使用的算法,很实用的-BFS algorithm matlab code, used in reactive power optimization of power system is a very practical algorithm.
BFS-algorithm-learning
- BFS经典算法,准备比赛时自己写的,一看即懂。里面有比较详细的算法介绍,可供学习参考。-BFS classic algorithm, ready to play when they write, a look that is to understand. There are more detailed algorithm introduced, available for study and reference.
BFS&DFS
- 广度优先搜索是从某一节点开始,搜索与其线连接的所有节点,按照广度方向像外扩展,直到不重复遍历所有节点。 深度优先搜索是从某一节点开始,沿着其搜索到的第一个节点不断深入下去,当无法再深入的时候,回溯节点,然后再在回溯中的某一节点开始沿另一个方向深度搜索,直到不重复的遍历所有节点。(Breadth first search begins with a node and searches all nodes connected to its line, extending in the direct
bfs1
- bfs floodfill Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a 'search key') and explores the neighbor nod