当前位置：
首页 资源下载
搜索资源 - strongly connected
搜索资源列表
-
0下载：
有向图的强连通分量算法的java语言实现，-directed graph algorithms strongly connected component of java language.
-
-
0下载：
递归算法求一个有向图的强连通分量，输入格式如压缩包中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
-
-
0下载：
有向图的强连通的分量的实现-directed graph strongly connected component of the realization
-
-
0下载：
数据结构中的求强连通分量的源程序，用vc6.0来编写-data structure for the strongly connected component of the source used to prepare vc6.0
-
-
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下载：
Java实现的图的强连通分支算法，可以输入图的节点和边，并返回图中所有的强连通分支-Java to achieve strong connectivity of the graph branch algorithm, can enter graph nodes and edges, and return to map all of the strongly connected branch
-
-
0下载：
求强连通分量，好像只是判断有几个强连通分量的。-Strongly connected component, it seems only a judge has several strongly connected components.
-
-
0下载：
求强连通分支，和双连通分支，输入两个文件，分别记录有向图和无向图-For strongly connected branch, and dual-branch connectivity, enter the two documents were recorded to map and undirected graph
-
-
0下载：
计算强连通分支的算法实现，从原图中得到强连通分支图并输出-Calculation of strongly connected branching algorithm, from the artwork to be strongly connected cladogram and output
-
-
0下载：
该算法主要是为了在图中找到强连通分支，请看源码注释。-The algorithm is mainly for the map to find strongly connected branch, see the source notes.
-
-
0下载：
在强连通分支算法中，选择任何顶点做起始点来执行深度优先搜索遍历，得到的强连通分支的解相同。-In the strongly connected branching algorithm, choose any vertex make a starting point to implement the depth-first search traversal obtained strongly connected branch of the same solution.
-
-
0下载：
cost存放了一个强连通图的边权矩阵，作为一个实例。
可在workspace中加载
运用此算法要注意多次试验。-storage cost of a strongly connected graph the right side of the matrix, as an example. Can be loaded in the workspace to use this algorithm to the attention of many tests.
-
-
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下载：
java实现，寻找强连通分支算法，Eclipse下可以直接打开工程-java implementation algorithm to find strongly connected components, Eclipse can open the project under
-
-
0下载：
Find out strongly connected component of a directed graph in c
-
-
0下载：
图的强连通部分,给定一个有向图，求改图的强连通部分-the strongly connected component
-
-
1下载：
有向图的强连通分量算法的实现，编译、运行及调试环境: Microsoft Visual C-Directed graph strongly connected components algorithm implementation, compiling, running and debugging environment: Microsoft Visual C++
-
-
0下载：
计算图的强连通分量，C代码实现，windows平台测试通过。(Strongly connected components of a graph)
-
