Location:
Search - dfs algorithm c
Search list
Description: 用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 the adjacent Chain preservation of information to find two nodes vi, vj the shortest path
Platform: |
Size: 3097 |
Author: 光光 |
Hits:
Description: 用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.
Platform: |
Size: 30273 |
Author: 张博 |
Hits:
Description: BFS、DFS、有向图、无向图中的各种算法的实现，可以自动生成图形。-BFS, DFS, to the map, no map to the realization of the algorithm can be automatically generated graphics.
Platform: |
Size: 119808 |
Author: 李想 |
Hits:
Description: 用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 the adjacent Chain preservation of information to find two nodes vi, vj the shortest path
Platform: |
Size: 3072 |
Author: 光光 |
Hits:
Description: 用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.
Platform: |
Size: 29696 |
Author: 张博 |
Hits:
Description: C语言常用算法，压缩文件，共20章，包含一些常用算法，如DFS-C language commonly used algorithm, compressed file, a total of 20 chapters, contains some commonly used algorithms, such as DFS
Platform: |
Size: 256000 |
Author: 唐志敏 |
Hits:
Description: 用c++语言实现的dfs非递归算法 个人感觉不错仅供参考-With c++ Language realize the non-recursive algorithm dfs good personal feeling is for reference only
Platform: |
Size: 1024 |
Author: 王力 |
Hits:
Description: 本文档容括了C（C＋＋）所有算法，分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theory, algorithm, knapsack algorithm, sorting algorithm, high-precision algorithms, tree traversal, binary conversion, the whole arrangement and combination of generation, search algorithm, greedy , backtracking framework, DFS framework, BFS framework, data structure-correlation algorithm. And examples of source
Platform: |
Size: 15360 |
Author: 海霞 |
Hits:
Description: 标准c++ acm算法实现,DFS求无向图生成树的算法.copy 至vc6.0 可编译-algorithm about dfs
Platform: |
Size: 1024 |
Author: fancy |
Hits:
Description: 图的深度搜索算法的C语言实现，平时的上机练习可做参考-Depth map search algorithm to achieve the C language, a reference class
Platform: |
Size: 177152 |
Author: dsx |
Hits:
Description: 数独（Sudoku）的DFS算法,没有优化,效率较为低下.C语言实现-Sudoku algorithm
Platform: |
Size: 1024 |
Author: Nova |
Hits:
Description: 1. 用ＤＦＳ判断一个无向图是否是连通图；
2. 为有向图的边分类，将它们的边分为前向边、后向边和交叉边；
3. 用ＤＦＳ和点消除求有向图的拓扑排序；
4. 判断有向图是不是强连通图，若不是，求强连通分量；
5. 判断有向图是不是半连同图；
6. 判断有向图是不是单连通图；
7. 判断无向图是不是双连通图。
通过以上编程对ＤＦＳ的应用，进一步了解ＤＦＳ的算法及它所代表的算法思想。
-1. Using DFS to test if a given undirected graph is connected or not.
2. Classify the edges of a directed graph into tree edges, back edges, forward edges or cross edges by a depth-first traversal of the graph. If the given graph is undirected, classify the edges into tree edges and back edges. And verify if a directed or undirected graph has a cycle.
3. Compute the topological order of a directed graph using both DFS algorithm and source removal algorithm.
4. A strongly connected graph is a directed graph with every pair of vertices reachable from each other. A strongly connected component C of a directed graph G is a subset of maximal vertices such that every pair of vertices in the subset are reachable from each other. A strongly connected component graph GSCC of a graph G is a directed graph that each component C of G is considered as a single vertex in GSCC and there is an edge between components C1 and C2 if there exist an edge (u, v) in the graph G with u belongs to C1 and v
Platform: |
Size: 10240 |
Author: 卢竹江 |
Hits:
Description: The basis of branch and bound algorithms is a ranking function. The ranking function assigns a value to each node in the graph. At each step, a branch and bound algorithm uses the ranking function to decide which node to expand next. In contrast, the usual DFS (Depth First Search) and BFS( Breadth First Search) exploration algorithms perform a blind search of the graph. Ideally, the ranking function, c(x), ranks nodes based on the cost of a minimal solution reachable from node x. The problem with this ranking function is that the minimal solution must be known ahead of time. Instead, the ranking function uses an estimate, g(x), of the cost of a minimal solution reachable from node x. Using g(x) to rank nodes may require exploring unnecessary nodes in the graph?particularly if g(x) is not a good estimate.The final element of the ranking function measures the cost of reaching a node from the root. As the searches gets farther from the root node, the node falls in the ranking.
Platform: |
Size: 8192 |
Author: sathiyaraj124 |
Hits:
Description: DFS algorithm c++ code
Platform: |
Size: 1024 |
Author: jebrail |
Hits:
Description: 在C环境中使用Bfs，Dfs的遍历算法创建邻接表建立图。-C environment Bfs Dfs traversal algorithm to create an adjacency table to create the diagram.
Platform: |
Size: 1024 |
Author: opsqcs |
Hits:
Description: 深度优先搜寻算法C语言实现，采用递归函数-Degree first search algorithm implemented by C language,recursive
Platform: |
Size: 419840 |
Author: 曹魏 |
Hits:
Description: 数据结构经典算法，宽度优先遍历，c语言源代码。-Data structure classical algorithm, breadth-first traversal, c language source code.
Platform: |
Size: 9216 |
Author: shorkmoly |
Hits:
Description: 带约束的最短路径求解问题（深度搜索算法DFS）C语音源代码 华为软件大赛-寻路-Solving the shortest path problem with constraints (depth search algorithm DFS) C source code for voice Huawei Software Competition- pathfinding
Platform: |
Size: 15360 |
Author: 崔琦 |
Hits:
Description: sudok solver 的算法实现， 采用dfs方法实现(sudok solver algorithm)
Platform: |
Size: 532480 |
Author: flydom
|
Hits:
Description: 图的数据结构相关实验，包括无向图的创建及图的BFS,DFS深度遍历，可进行最短路径的算法有最小生成树(It includes the creation of an undirected graph and the BFS, DFS depth traversal of the graph, and the shortest path algorithm has the minimum spanning tree)
Platform: |
Size: 1024 |
Author: 一只山 |
Hits: