搜索资源列表
code
- C语言常用算法，压缩文件，共20章，包含一些常用算法，如DFS-C language commonly used algorithm, compressed file, a total of 20 chapters, contains some commonly used algorithms, such as DFS
dfs
- 动态提示控件，需要编译后使用，超级好用，欢迎大家下载此控件，好东西大家用-Dynamic prompt control, the need for the compiler to use, super easy to use, welcome everyone to download this control, good things with everyone
PathFinder
- 两种AstarPathFinder 一种DijkstraPathfinder BFS，DFS等相关寻路代码总结 带地图随机生成和记时器-AstarPathFinder a two DijkstraPathfinderBFS, DFS and other related routing code summed up with randomly generated maps and timer
new_search
- 基本数据结构与STL 树及遍历 图的DFS与BFS -Basic data structures and STL tree and graph traversal DFS and BFS
tu-table-DFS
- 本程序采用深度优先的方法完成图的遍历，包括连通图和非连通图。-This procedure used the method of depth-first traversal of the complete diagram, including the connected graph and non-connected graph.
huafenxuanqu
- 划分选区的最优解模型，利用dfs深度搜索，得出最优解-The optimal solution of the demarcation of constituencies model, the use of dfs depth of search, the optimal solution obtained
match
- 三个求二分图最大匹配的程序（bfs，dfs，多增光路算法）-Three for the maximum bipartite graph matching procedure (bfs, dfs, multi-path algorithm Zengguang)
C
- 本文档容括了C（C＋＋）所有算法，分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theor
DFSfunction
- DFS非递归函数 函数功能：图的dfs的非递归算法(用堆栈实现) 输入：图的邻接矩阵 输出：dfs序列 -DFS non-recursive function function function: dfs map non-recursive algorithm (using the stack to achieve) Input: adjacency matrix graph output: dfs sequence
find_all_loops
- 找出有向图中所有简单回路，深搜DFS+标记-Directed graph to find all the simple loop, deep search DFS+ Tags
graph
- 图的邻接表存储表示法 源码 这是进行计算机图论算法的基础 如最基本算法DFS BFS 图的邻接表存储表示法 源码 这是进行计算机图论算法的基础 如最基本算法DFS BFS-Adjacency list graph representation of source storage This is a computer algorithm based on graph theory such as the basic algori
dfs_tree
- 标准c++ acm算法实现,DFS求无向图生成树的算法.copy 至vc6.0 可编译-algorithm about dfs
Redblacktree
- This a solution of cavern problem using red black tree and DFS and BFS-This is a solution of cavern problem using red black tree and DFS and BFS
puzzle
- puzzle program witch dfs bsf and a* algorithm
maze_dfs
- solve maze with dfs and bfs
Dfs
- CREATE GRAPH WITH NEW TECHNOLOGY OF DRAWING
shixiantudebianli
- MatToList(MGraph g,ALGraph *&G)：将邻接矩阵g转换成邻接表G。 ListToMat(ALGraph *G,MGraph &g)：将邻接表G转换成邻接矩阵g。 DispMat(MGraph g)：输出邻接矩阵g。 DispAdj(ALGraph *G)：输出邻接表G。 DFS(ALGraph *G,int
myproject
- 应用DFS，递归调用完成的图中环查找算法过程-Application of DFS, recursive calls to complete the plan process in Central search algorithm
DFS
- 标准的深度优先搜索算法，可实现节点遍历、产生随机路由、检测图中是否有回路等功能，-Standard depth-first search algorithm, the node traversal can be achieved, resulting in a random routing, testing whether there is any loop diagram functions
DFS
- 图论编程，包含文件操作，建立图的邻接表，并实现深度优先搜索-Graph theory programming, including file operations, the establishment of plans of the adjacent table, and the depth-first search