搜索资源列表
-
0下载：
有向图的强连通分量算法的java语言实现，-directed graph algorithms strongly connected component of java language.
-
-
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下载：
求强连通分量，好像只是判断有几个强连通分量的。-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下载：
给定n个结点的有向图的邻接矩阵，可判断该图是否为强连通的，单向连通的，或弱连通的。-For a given n-node directed graph adjacency matrix, can determine whether the plan strongly connected, and one-way connected, or weak connectivity.
-
-
0下载：
无向图的强连通计算
高效率算法 图论算法-No calculation of strongly connected directed graph
-
-
0下载：
Tarjan s strongly connected components algorithm
-
-
1下载：
数据结构基本算法演示程序实现：
1、实现KMP模式匹配算法、哈夫曼编码算法、由遍历序列恢复二叉树、Prim算法、Kruskal算法、Floyd算法、Dijkstra算法、拓扑排序、关键路径算法、二叉排序树生成算法（含平衡化）、哈希表生成及哈希查找算法、希尔排序、快速排序、堆排序、归并排序、基数排序。（四则表达式计算、矩阵运算、有向图的强连通分量求解）
2、算法中的链表结构和数组结构的基本操作要求单独函数实现（同组内算法要求共享使用）。
要求数据结构基本算法演示程序具有菜单选择，算法要
-
-
0下载：
tps模拟退火 cost存放了一个强连通图的边权矩阵，作为一个实例。
可在workspace中加载
运用此算法要注意多次试验。-tps simulated annealing cost holds the edge of a strongly connected graph weight matrix, as an example. Loaded in the workspace using this method should pay attention to several expe
-
-
0下载：
这是一个实现数据结构中求解强连通子图的小程序，是实验课的产物，希望对学生朋友有帮助。-This is a data structure for solving strongly connected subgraph of small procedures, the product of the experimental class, the students want to help friends.
-
-
0下载：
怎么判断一个采用邻接表结构的有向图G是否为强连通图? 强连通块划分代码实现-Adjacency list used to determine how the structure of a directed graph G is a strongly connected graph? Strongly connected block of code division
-
-
0下载：
The Strongly connected component algorithm. This is my exercise of Introduction to Algorithm subject.
-
-
0下载：
所为2-sat问题，就是2判断问题。该算法是用拆点的方式建图，用找强连通子图的方法推出矛盾，用以判断2-sat是否可行。经典实现，-2-sat, is a matter of judgment. The algorithm is used to find a demolition point built strongly connected subgraph launched contradictions, used to determine whether the 2-sat. Classic
-
-
0下载：
给定一个图，找强连通分量，使用Tarjan算法-Given a graph, find the strongly connected components, the use of Tarjan algorithm
-
