搜索资源列表
多变量寻优
- 多变量寻优的源码，包括基本算法如下：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.
ck_conty
- ck_conty为判断图的连通性的matlab mex文件，另附带包含BFS和DFS的C源程序
New-folder
- This code is using for Path Planning by BFS.
BFS
- 采用共轭方向法中的BFS方法进行优化，程序中采用简单算例，并附有文档说明-The conjugate direction method in the BFS method to optimize the process using a simple numerical examples, along with documentation
P
- 规范 BFS 写法，可以有效地避免一些状态判重和状态转移上的细节错误，使用优先队列，这里不用优先队列会错。-BFS written specification, can effectively avoid the details of some of the state and the state transition heavy sentence on the error, use the priority queue, priority queues are not wrong here.
multi
- 多变量寻优的源码，包括基本算法如下：DFP法（又称变尺度法），BFS法、一阶梯度法，共扼梯度法。-Multivariate optimization of the source code, including basic algorithm is as follows: DFP method (also known as variable metric method), BFS method, a ladder degree method, conjugate gradient method.
Seqence
- 在Matlab中使用函数实现队列操作并且应用到图的宽度遍历（BFS）中-A realization of Sequence operation in Matlab. And an example applied in Breadth First Search（BFS）.
BFS
- 广度优先搜索算法，做了很详细的解释，大家可以有空学习交流下。-Breadth-first search algorithm, and made a very detailed explanation, you can free exchange under studying.
rop_matlab1
- 利用宽度有限方法（BFS）寻找最短路径和最小树的算法和算例。-Use of finite width method (BFS) to find the shortest path and minimum tree algorithms and numerical examples.
BFS
- BFS algorithm (Matlab)
BFS
- 用MATLAB写的宽度优先搜索函数，支持障碍设置和四叉树/八叉树的选择，在路径搜索方面有用。-First search function using MATLAB written in width, support the obstacles set up and quadtree/octree useful in terms of route search.
bfs
- breadth first search
newton
- 非线性方程组的BFS秩2拟Newton方法MATLAB源代码-Nonlinear Equations BFS rank 2 Quasi Newton method MATLAB source code
BFS-algorithm-matlab
- 前推回代算法matlab代码，在计算电力系统无功优化时使用的算法，很实用的-BFS algorithm matlab code, used in reactive power optimization of power system is a very practical algorithm.
bfs
- backward forward sweep power flow analaysis
BFS&DFS
- 广度优先搜索是从某一节点开始，搜索与其线连接的所有节点，按照广度方向像外扩展，直到不重复遍历所有节点。 深度优先搜索是从某一节点开始，沿着其搜索到的第一个节点不断深入下去，当无法再深入的时候，回溯节点，然后再在回溯中的某一节点开始沿另一个方向深度搜索，直到不重复的遍历所有节点。(Breadth first search begins with a node and searches all nodes connected to its line, extending in the direct