搜索资源列表
BFS
- bfbreadth first search methode for graph theory
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
ddw
- 创建图G（任选邻接矩阵或邻接表） 2. 显示图 3. 深度优先搜索遍历图 4. 广度优先搜索遍历图 5. 在图中插入顶点 6. 在图中插入边 -Create a graph G (optional adjacency matrix or adjacency table) 2. The depth-first search traversal Figure 3. Figure 4. Figure 5. BFS traversal 6. Insert Vertex
DFSLaBFSL
- DFS与BFS,深度查询与广度查询，质量高-DFS and BFS
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
Game-of-Maze
- MFC下编写迷宫游戏，C++编写，采用BFS自动寻路算法，-MFC ，c++,fun maze game
POJ1915_bfs
- poj1915双向bfs.-poj 1915
kvm_psci
- Max name lengths of BFS for Linux v2.13.6.
BreadthFirstSearch
- Tried to implement BFS in java
DFS-BFS
- 2014年北京大学暑假公开课算法讲解课件之搜索，讲解详细，分析透彻-2014 Peking University summer open class algorithm courseware on the graph theory, explain the detailed, thorough analysis
masiryab
- find the way through the maze by A* search and BFS search
信号处理经典算法
- 15个信号处理经典算法模型及代码实现,涵盖 Dijkstra.DP.BFS/DFS.红黑树.KMP.遗传.启发式搜索.图像 特征提取 SIFT.傅立叶变换.Hash.快速排序.SPFA.快递选择 SELECT 等 15 个经典基础算法，
DFSBFS
- 数据结构图的遍历算法，DFS（深度优先便利）和BFS（广度优先遍历）-DFS and BFS DATA STRUCT
BFS_Iterate
- BFS mapreduce 实现，计算社交网络中各节点到源节点的最长距离。-BFS mapreduce
bfs_chess.tar
- Deployment of towers and horses on chessboard. Implemented simple BFS graph algorithm.
bfs_fs
- include linux bfs_fs.h - BFS data structures on disk.
eight-queens
- 八皇后问题，包括BFS，DFS和回溯法运算。也可以解决n皇后问题。- Eight queens problem, including BFS, DFS and backtracking operations. N queens problem can be solved.
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