搜索资源列表
BFSTraverse
- 利用BFS算法和队列实现在棋盘上已知“马”的初始位置，得到其在指定步数内可以到达的所有位置的功能-Use BFS algorithm and queue on the board to achieve a known " horse" in the initial position, get the function which can be reached within a specified number of steps in all positions
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.
5th_graph0518cg.tar
- 图的邻接矩阵跟邻接表的创建，遍历等，核心是深度优先遍历DFS和广度优先遍历BFS，其中广度优先遍历使用了队列，bfs写了两种方式，详情可以查看注释。使用gcc编译，-Adjacency matrix with the adjacency list creation, traversal, depth-first traversal of the core DFS and breadth-first traversal BFS, breadth-first traversal which uses
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.
search-chen
- 使用Python编写的AI程序Pacman，可以适合AI的初学者，有BFS, DFS, UCS, A Star 运行的命令在commands.txt文件里 可以用 bash commands.txt演示-AI programs written in Python Pacman, AI can fit beginners, there BFS, DFS, UCS, the command runs in commands.txt A Star file can bash commands.t
rop_matlab1
- 利用宽度有限方法（BFS）寻找最短路径和最小树的算法和算例。-Use of finite width method (BFS) to find the shortest path and minimum tree algorithms and numerical examples.
Project_BFS
- 广度优先搜索算法的C++实现，标准的图结构实现，算法经过优化，运行效率高-Realize BFS algorithm using C++ and data struct
POJ1915_bfs
- poj1915双向bfs.-poj 1915
DFS-BFS
- 2014年北京大学暑假公开课算法讲解课件之搜索，讲解详细，分析透彻-2014 Peking University summer open class algorithm courseware on the graph theory, explain the detailed, thorough analysis
bfs_chess.tar
- Deployment of towers and horses on chessboard. Implemented simple BFS graph algorithm.
BFS
- 用MATLAB写的宽度优先搜索函数，支持障碍设置和四叉树/八叉树的选择，在路径搜索方面有用。-First search function using MATLAB written in width, support the obstacles set up and quadtree/octree useful in terms of route search.
source
- to solve the best case number of which how many times the king located at some position(x1,y1) to move to kill the the other ones located some position(x2,y2) in the chessBoard. implemented by BFS-to solve the best case number of which how many ti
N-Queue_DFS
- BFS法求解N皇后问题，输出全部解决方案。-BFS method for solving N queens problem and output all solutions.
knight-tour_DFSandBFS_SQueue
- 在一个N*N的棋盘上指点任意一点的坐标，以马走日的方式走完整个棋盘且没有重复，试分别用DFS、BFS方法求解并输出全部可能的路径。-knight tour problem solved by the method of BFS and DFS.
map
- 数据结构 BFS DFS Prim kruscal dijkstra 代码-code of BFS DFS Prim kruscal dijkstra
newton
- 非线性方程组的BFS秩2拟Newton方法MATLAB源代码-Nonlinear Equations BFS rank 2 Quasi Newton method MATLAB source code
Connect-Set
- 网易云课堂-陈越、何钦铭-数据结构-2016春 PTA-06-图1 列出连通集 给定一个有NNN个顶点和EEE条边的无向图，请用DFS和BFS分别列出其所有的连通集。假设顶点从0到N− 1N-1N− 1编号。进行搜索时，假设我们总是从编号最小的顶点出发，按编号递增的顺序访问邻接点。-Given a free E N vertices and edges of the graph, please list the set of all of its communicat
BFS_graph
- 这是数据结构中图的广度优先算法的实现。广度优先算法是按照每个节点的拥有的孩子数目来进行遍历的。而不像图的深度优先算法是按照深层次，然后如果不能继续进入更深一层，就往回遍历。-BFS program of tree have a large of difference of the DFS program of trees.The produre of it is with the method of the children of a point ,rather than the depth o
oop-Week9
- 关于布线问题的一些代码,包括BFS 过程和回溯过程-Some code on wiring problems, including the BFS process and backtracking process