搜索资源列表
图论
- BFS、DFS、有向图、无向图中的各种算法的实现，可以自动生成图形。-BFS, DFS, to the map, no map to the realization of the algorithm can be automatically generated graphics.
一个触摸屏程序示例
- 触摸屏sdf触摸df屏触摸dfs屏触摸sdf屏触摸屏-Touchscreen sdf touch screen df dfs touch screen touch screen sdf Touchscreen
BFSandDFS
- 用C写的源程序功能分别是1.用DFS算法判断有向图中是否有环2.从文件中读图，用邻接链表保存信息，寻找两个结点vi,vj间的最短路径-written in C source is a function respectively. DFS algorithm used to determine whether there are plans Central 2. Interpret drawings from the file, use
有向图从邻接矩阵转换为邻接表后的dfs
- 有向图从邻接矩阵转换为邻接表后再深度优先遍历-a graph from the adjacency matrix conversion of the adjacent#$#!142996#!#$read IntelCPU serial number. Rar!#$#read Intel CPU serial number. Rar read Intel CPU serial number. Read rar Intel CPU seri
导游图
- 用c语言实现的导游图，有图形界面，支持鼠标操作，使用dfs和floyd算法实现给出两点间最短路和最长路。-used language guides map, a graphical interface, mouse support operation, use dfs and Floyd algorithm is the shortest path between two points and the longest path.
search_short_path
- 采用A*算法完成地图路径规划功能,返回得到最短路径,实际效果优于BFS，DFS等算法。-A * algorithm using maps path planning function returns the shortest path, the actual effects are superior to BFS, algorithms such as DFS.
haokan
- 试扩充深度优先搜索算法，在遍历图的过程中建立生成森林的左子女-右兄弟链表。算法的首部为 void Graph::DFS ( const int v, int visited [ ], TreeNode<int> * t ) 其中，指针t指向生成森林上具有图顶点v信息的根结点。（提示：在继续按深度方向从根v的某一未访问过的邻接顶点w向下遍历之前，建立子女结点。但需要判断是作为根的第一个子女还是作为其子女的右兄弟链入生成树。）
test_1_DFS_BFS
- 比较DFS与BFS 简单的实现了，小地图范围的两种寻路算法原理的比较。 左键控制，可自动寻找路径，方便观察-DFS compared with the simple realization of BFS, the small scope of the two map routing algorithms for comparison. Left control that can automatically find a path
tupopaixu
- 图的DFS遍历，以及两种拓扑排序的实现，一种是DFS拓扑排序，另一种是无后继结点的拓扑排序-map DFS traversal, and the two topological sorting the realization DFS is a topological sorting, Another is no subsequent node of topological sorting
fudfs
- 用dfs非递归算法遍历图。创 建图是用链表来实现。 -with scores of non - recursive algorithm traverse map. Map is created using chain is to be achieved.
BFS_DFS_Astar
- Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format
mmsk0306
- 是一个软件,我不知道啊 hao nan mmm dfs -is a software, I do not know ah hao nan mmm mmm scores
dfs
- 深度优先搜索算法解决八码难题-depth-first search algorithm to solve eight problems yards
CodeHighlighter
- for steing dht code dkwe skdfks dfs
1011
- 推荐pku_1011上的好题， 经典DFS+剪枝 解题报告 算法思想.
DFS
- DFS算法源码，有需要的下载，够20个字了没，应该不够，这下够了-DFS algorithm source code, there is a need to download, 20 words enough yet, it should be enough, which is enough under
dfs
- 无向图的关键边,dfs邻接阵形式,O(n^2)-The critical edge of the undirected graph, dfs adjacency matrix form, O (n ^ 2)
dfs
- 非递归方式实现深度优先遍历图，可以有效的减少堆栈的使用，提高效率-dfs algorithm non-recurrence version
BFS&DFS
- 广度优先搜索是从某一节点开始，搜索与其线连接的所有节点，按照广度方向像外扩展，直到不重复遍历所有节点。 深度优先搜索是从某一节点开始，沿着其搜索到的第一个节点不断深入下去，当无法再深入的时候，回溯节点，然后再在回溯中的某一节点开始沿另一个方向深度搜索，直到不重复的遍历所有节点。(Breadth first search begins with a node and searches all nodes connected to its
DFS BFS 图
- 深度优先遍历和广度优先遍历算法实现从定点开始的遍历序列。(Depth first traversal and breadth first traversal algorithm to achieve the starting point from the traversal sequence)