搜索资源列表
syndiastikhbeltistopoihshaskisi
- DFS CODE Depth-first search algorithm Matlab source this procedure site collected from abroad, is the standard depth-first search algorithm, can be achieved and the detection circuit node traversal functions, details see
graph
- 有向图 采用邻接表存储 DFS和BFS方法遍历 为方便表示,结点数小于10 用V0-V9表示不同的结点的-Directed graph using adjacency list method of storing DFS and BFS traversal for the convenience that the number of nodes is less than 10 with V0-V9 for different node
BFS-DFS
- code in c for DFS AND BFS
ApplicationsOfDepth-FirstTraversal
- 1. 用ＤＦＳ判断一个无向图是否是连通图； 2. 为有向图的边分类，将它们的边分为前向边、后向边和交叉边； 3. 用ＤＦＳ和点消除求有向图的拓扑排序； 4. 判断有向图是不是强连通图，若不是，求强连通分量； 5. 判断有向图是不是半连同图； 6. 判断有向图是不是单连通图； 7. 判断无向图是不是双连通图。 通过以上编程对ＤＦＳ的应用，进一步了解ＤＦＳ的算法及它所代表的算法思想。 -1. Using DF
main
- Dijkstra and DFS. It finds all the shortest ways from one point to all others. Then it counts all the ways which is always coming to the destiny.
DFS
- Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each
dfs
- this code for dfs in c-this code for dfs in c++
dfs-bfs
- 简单的图的深度搜索和广度搜索，适合初学者交流-a simple example of DFS and BFS
DFS
- DFS算法，我自己写的，主要用邻接矩阵存储图-DFS algorithm, I wrote it myself, the main memory map with the adjacency matrix
DFS
- DFS判断两点间的连通性，即1与n间的连通性-DFS to determine the connectivity between two points, that is between 1 and n connectivity
DFS-And-BFS-2D
- This is a project about BFS and DFS algorithm
Machines-Based-on-DFS
- 深度优先搜索的支持向量机参数优化算法 Study on Parameters Optimization of Support Vector Machines Based on DFS :研究支持向量机参数优化问题，由于算法要求准确选择 SVM 参数，支持向量机在处理大样本数据集时和最优模型参 数确定时，消耗的时间长、占有内存大，易获得局部最优解的难题。为了解决支持向量机存在的不足，采用深度优先搜索算 法对其参数优化机
DFS
- DFS作业，算法作业，c++ dfs算法作业-DFS homework
DFS
- DFS algorithm c++ code
DFS
- MPI implementation the DFS method
dfs(2)
- dfs algorithm in matlab
DFS
- DFS图的深度优先遍历！C++编写,数据结构-programing by c++
Bfs-Dfs
- 在C环境中使用Bfs，Dfs的遍历算法创建邻接表建立图。-C environment Bfs Dfs traversal algorithm to create an adjacency table to create the diagram.
DFS
- 有向图或者无向图的深度优先遍历，给出遍历的节点序列-DFS for the directed or undirected graph ,which returns the ordered vertex set
prolog-DFS
- 在用prolog来实现DFS算法，基本思想是使用回溯和stack-Using the DFS in Prolog