Description: 求强连通分量，好像只是判断有几个强连通分量的。-Strongly connected component, it seems only a judge has several strongly connected components. Platform: |
Size: 1024 |
Author: |
Hits:
Description: ACM题解：The Bottom of a Graph 求图的强连通分量的好例子-ACM problem solution: The Bottom of a Graph a good example of graph of strongly connected components Platform: |
Size: 529408 |
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: java实现，寻找强连通分支算法，Eclipse下可以直接打开工程-java implementation algorithm to find strongly connected components, Eclipse can open the project under Platform: |
Size: 8192 |
Author:尹文昊 |
Hits:
Description: 数据结构基本算法演示程序实现：
1、实现KMP模式匹配算法、哈夫曼编码算法、由遍历序列恢复二叉树、Prim算法、Kruskal算法、Floyd算法、Dijkstra算法、拓扑排序、关键路径算法、二叉排序树生成算法（含平衡化）、哈希表生成及哈希查找算法、希尔排序、快速排序、堆排序、归并排序、基数排序。（四则表达式计算、矩阵运算、有向图的强连通分量求解）
2、算法中的链表结构和数组结构的基本操作要求单独函数实现（同组内算法要求共享使用）。
要求数据结构基本算法演示程序具有菜单选择，算法要有结果的显示形式，显示程序框架
-Basic algorithm demo program data structures to achieve:
1, and KMP pattern matching algorithm, Huffman coding algorithm, the binary tree traversal sequence recovery, Prim algorithm, Kruskal algorithm, Floyd algorithm, Dijkstra algorithm, topological sorting, critical path algorithm, binary sort tree generation algorithm (including the balance of), hash table hash search algorithm generates and Hill sort, quick sort, heap sort, merge sort, radix sort. (D expression computing, matrix operations, have to solve the graph strongly connected components)
2, the algorithm in the list structure and basic operation of the array structure requires a separate function to achieve (within the algorithm requires the same set of shared use.)
Basic algorithm required data structure has the menu to select the demonstration program, the algorithm should have the results display format, display program framework Platform: |
Size: 20480 |
Author:dark |
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: 给定一个图，找强连通分量，使用Tarjan算法-Given a graph, find the strongly connected components, the use of Tarjan algorithm Platform: |
Size: 260096 |
Author:dianlujitao |
Hits:
Search - strongly connected components