当前位置：
首页 资源下载
搜索资源 - strongly connected components
搜索资源列表
-
1下载：
ACM题解：The Bottom of a Graph 求图的强连通分量的好例子,ACM problem solution: The Bottom of a Graph a good example of graph of strongly connected components
-
-
0下载：
1. 用ＤＦＳ判断一个无向图是否是连通图；
2. 为有向图的边分类，将它们的边分为前向边、后向边和交叉边；
3. 用ＤＦＳ和点消除求有向图的拓扑排序；
4. 判断有向图是不是强连通图，若不是，求强连通分量；
5. 判断有向图是不是半连同图；
6. 判断有向图是不是单连通图；
7. 判断无向图是不是双连通图。
通过以上编程对ＤＦＳ的应用，进一步了解ＤＦＳ的算法及它所代表的算法思想。
-1. Using DFS to test if a given undirecte
-
-
0下载：
求强连通分量，好像只是判断有几个强连通分量的。-Strongly connected component, it seems only a judge has several strongly connected components.
-
-
0下载：
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 Visua
-
-
0下载：
强连通分量的实现 强连通分量的实现 -Strongly connected component strongly connected component to achieve the realization of strongly connected components to achieve the realization of strongly connected components
-
-
0下载：
Strongly connected components of a graph + euler tour-Strongly connected components of a graph+ euler tour
-
-
0下载：
java实现，寻找强连通分支算法，Eclipse下可以直接打开工程-java implementation algorithm to find strongly connected components, Eclipse can open the project under
-
-
0下载：
Tarjan s strongly connected components algorithm
-
-
1下载：
数据结构基本算法演示程序实现：
1、实现KMP模式匹配算法、哈夫曼编码算法、由遍历序列恢复二叉树、Prim算法、Kruskal算法、Floyd算法、Dijkstra算法、拓扑排序、关键路径算法、二叉排序树生成算法（含平衡化）、哈希表生成及哈希查找算法、希尔排序、快速排序、堆排序、归并排序、基数排序。（四则表达式计算、矩阵运算、有向图的强连通分量求解）
2、算法中的链表结构和数组结构的基本操作要求单独函数实现（同组内算法要求共享使用）。
要求数据结构基本算法演示程序具有菜单选择，算法要
-
-
0下载：
强连通分支Kosaraju算法+源码.txt
强连通分支Kosaraju算法+源码.txt-Strongly connected component Kosaraj strongly connected branch Kosaraju algorithm+ source code. Txt strongly connected components of Kosaraju algorithm+ source code. Txtu algorithm+ source code. Txt
-
-
0下载：
给定一个图，找强连通分量，使用Tarjan算法-Given a graph, find the strongly connected components, the use of Tarjan algorithm
-
-
0下载：
强连通分支Kosaraju算法+源码.txt -Strongly connected component Kosaraj strongly connected branch Kosaraju algorithm+ source code. Txt strongly connected components of Kosaraju algorithm+ source code. Txtu algorithm+ source code. Txt
-
-
0下载：
pascal实现强连通分量的算法分析及代码示例-Algorithm analysis and code examples of strongly connected components of Pascal
-
-
1下载：
有向图的强连通分量算法的实现，编译、运行及调试环境: Microsoft Visual C-Directed graph strongly connected components algorithm implementation, compiling, running and debugging environment: Microsoft Visual C++
-
-
0下载：
Determining Strongly connected components in graph.
-
-
0下载：
计算图的强连通分量，C代码实现，windows平台测试通过。(Strongly connected components of a graph)
-
