Description: 递归算法求一个有向图的强连通分量，输入格式如压缩包中data4.txt，第一行为顶点个数。输出到result.txt中。-recursive algorithm for a directed graph strongly connected component, the input format such as compression package data4.txt. the first acts of the number of vertices. Result.txt exported to China. Platform: |
Size: 6866 |
Author:王军 |
Hits:
Description: 数据结构中的求强连通分量的源程序，用vc6.0来编写-data structure for the strongly connected component of the source used to prepare vc6.0 Platform: |
Size: 1525 |
Author:叶芦芦 |
Hits:
Description: 数据结构中的求强连通分量的源程序，用vc6.0来编写-data structure for the strongly connected component of the source used to prepare vc6.0 Platform: |
Size: 1024 |
Author:叶芦芦 |
Hits:
Description: 递归算法求一个有向图的强连通分量，输入格式如压缩包中data4.txt，第一行为顶点个数。输出到result.txt中。-recursive algorithm for a directed graph strongly connected component, the input format such as compression package data4.txt. the first acts of the number of vertices. Result.txt exported to China. Platform: |
Size: 7168 |
Author:王军 |
Hits:
Description: 求有向图的强连通分量，使用2次dfs的算法，具体名字我也忘掉了-Order to have a strongly connected directed graph component, the use of 2 dfs algorithm, the specific name I have forgotten Platform: |
Size: 2048 |
Author:zzq |
Hits:
Description: 用邻接矩阵的形式实现了求有向图的强连通分量。-Adjacency matrix with the form of a demand directed graph strongly connected component. Platform: |
Size: 2048 |
Author:周建勇 |
Hits:
Description: 求强连通分量，好像只是判断有几个强连通分量的。-Strongly connected component, it seems only a judge has several strongly connected components. Platform: |
Size: 1024 |
Author: |
Hits:
Description: Strongly Connected Component Library to obtaion strongly connected components of a graph, for PC platforms writeen in Visual C-Strongly Connected Component Library to obtaion strongly connected components of a graph, for PC platforms writeen in Visual C++ Platform: |
Size: 58368 |
Author:Orhan Ucar |
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 Strongly connected component algorithm. This is my exercise of Introduction to Algorithm subject. Platform: |
Size: 58368 |
Author:william |
Hits:
Description: 月亮和五毛钱,主要考查了广度优先搜索、强连通分量、缩点、动态拓扑规划等相关知识-Moon and five cents, the main test of breadth-first search, strongly connected component, shrinkage point, dynamic topology planning and other related knowledge Platform: |
Size: 31744 |
Author:刘晓辉 |
Hits:
Search - strongly connected component