搜索资源列表
Handout
- 创建图的邻接表存储结构,输出邻接表数据(验证创建过程),深度优先遍历(DFS) ,广度优先遍历(BFS),增加一个顶点到图, 删除一个顶点(同时删除其所有邻接边) ,增加一条弧到图,从图中删除一条弧- Creating adjacency table storage structure, the output adjacency table data (validation creation process), depth-first traversal (DFS), breadth-fi
tu
- 图的深度优先与广度优先遍历 利用邻接矩阵或邻接表作为存储结构建立一个无向图，每个顶点中存放一种水果名(例如apple、orange、banana等，并要求从键盘输入)，顶点数不少于5个。要求分别以深度优先搜索(DFS)和广度优先搜索(BFS)进行遍历，输出遍历结果。 -Depth-first and breadth-first traversal Adjacency matrix or adjacency list use as
pathfinding-0.1.1-src
- A星， Dijkstra，双向BFS实现的路径规划程序Python源码，有界面，附带演示效果。-A star, Dijkstra, BFS achieve bidirectional path planning process Python source code, interface, with a demonstration effect.
data_struct
- 自己实现的重要的数据结构以及算法（包括dfs,bfs,huffman code,kmp,dij等）。每一个.cpp或.c文件都是一个可直接运行的程序。-Important data structures and algorithms to achieve their own (including dfs, bfs, huffman code, kmp, dij, etc.). Every one. Cpp or. C file is a program can be run directly.
Maze-Problem
- 经典迷宫问题BFS，手动打表寻找出口解决-Classic maze problem, manually hit the table looking for export
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.
ricky1
- BFs program display from code
TraveseMap
- 用深度优先搜索和广度优先搜索算法遍历一个图-travel map by DFS and BFS algrithm
1087(A-Plug-for-UNIX)(SAPPGAPPBFS)
- poj1087,SAP+GAP+BFS，最快的基于增广路径的最大流算法-poj1087, SAP+GAP+BFS, the fastest maximum flow algorithm based on augmenting path
11
- 发布无方向广度优先搜索遍历代码，有详细注释，可以直接应用于案例-Released without direction BFS traversal code, there are detailed notes, can be directly applied to the case
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
bfs
- 用广度搜索方法实现 找迷宫类游戏 从一点搜索到另一点-With the breadth of search methods to find the maze game from the realization that search to another point
Seqence
- 在Matlab中使用函数实现队列操作并且应用到图的宽度遍历（BFS）中-A realization of Sequence operation in Matlab. And an example applied in Breadth First Search（BFS）.
shotestpath1.c
- graph algorithms bfs and dfs
BFS-breadth-first-search
- breadth-first search
JavaCrawler
- 基于BFS的web网络爬虫,支持robot.txt-web crawlers, support robot.txt
maxflow-of-bfs-and-dfs
- 分别利用广度和深度求最大流，是很好的学习最大流算法的代码，简单，实用-method maxflow
BFS
- Breadth First Search Algorithm
BFS
- 广度优先搜索算法，做了很详细的解释，大家可以有空学习交流下。-Breadth-first search algorithm, and made a very detailed explanation, you can free exchange under studying.