Search - strongly connected

Search - strongly connected - List

[Other resource] GraphCC DL : 0: 有向图的强连通分量算法的java语言实现，-directed graph algorithms strongly connected component of java language.
Date : 2008-10-13 Size : 1.57kb User : 黄牛
[JSP/Java] scc DL : 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 to China.
Date : 2008-10-13 Size : 6.71kb User : 王军
[Other resource] zb2 DL : 0: 有向图的强连通的分量的实现-directed graph strongly connected component of the realization
Date : 2008-10-13 Size : 2.37kb User : 张冰
[Other resource] sgraph DL : 0: 数据结构中的求强连通分量的源程序，用vc6.0来编写-data structure for the strongly connected component of the source used to prepare vc6.0
Date : 2008-10-13 Size : 1.49kb User : 叶芦芦
[Data structs] zb2 DL : 0: 有向图的强连通的分量的实现-directed graph strongly connected component of the realization
Date : 2025-07-12 Size : 2kb User : 张冰
[Data structs] sgraph DL : 0: 数据结构中的求强连通分量的源程序，用vc6.0来编写-data structure for the strongly connected component of the source used to prepare vc6.0
Date : 2025-07-12 Size : 1kb User : 叶芦芦
[Data structs] GraphCC DL : 0: 有向图的强连通分量算法的java语言实现，-directed graph algorithms strongly connected component of java language.
Date : 2025-07-12 Size : 1kb User : 黄牛
[JSP/Java] scc DL : 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 to China.
Date : 2025-07-12 Size : 7kb User : 王军
[Data structs] StrongComent DL : 0: 求有向图的强连通分量，使用2次dfs的算法，具体名字我也忘掉了-Order to have a strongly connected directed graph component, the use of 2 dfs algorithm, the specific name I have forgotten
Date : 2025-07-12 Size : 2kb User : zzq
[JSP/Java] depthFirstDigraph DL : 0: 用java语言深度优先回溯法实现有向图的强连通分量-Using java language backtracking depth-first to achieve directed graph strongly connected component
Date : 2025-07-12 Size : 2kb User : 上将
[Data structs] Cpp1 DL : 0: 求强连通分量，好像只是判断有几个强连通分量的。-Strongly connected component, it seems only a judge has several strongly connected components.
Date : 2025-07-12 Size : 1kb User :
[Data structs] TheBottomofaGraph.tar DL : 0: ACM题解：The Bottom of a Graph 求图的强连通分量的好例子-ACM problem solution: The Bottom of a Graph a good example of graph of strongly connected components
Date : 2025-07-12 Size : 517kb User : 夏雨可
[Graph Recognize] SCC_Library DL : 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 Visual C++
Date : 2025-07-12 Size : 57kb User : Orhan Ucar
[Other] fdgd DL : 0: 强连通分量的实现强连通分量的实现 -Strongly connected component strongly connected component to achieve the realization of strongly connected components to achieve the realization of strongly connected components
Date : 2025-07-12 Size : 1kb User : cjl
[JSP/Java] Suanfa_3 DL : 0: java实现，寻找强连通分支算法，Eclipse下可以直接打开工程-java implementation algorithm to find strongly connected components, Eclipse can open the project under
Date : 2025-07-12 Size : 8kb User : 尹文昊
[Special Effects] ApplicationsOfDepth-FirstTraversal DL : 0: 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
Date : 2025-07-12 Size : 10kb User : 卢竹江
[SCM] strongly-connected- DL : 0: Find out strongly connected component of a directed graph in c
Date : 2025-07-12 Size : 1kb User : Smita Naval
[Shell api] strongly-connected-component- DL : 0: 图的强连通部分,给定一个有向图，求改图的强连通部分-the strongly connected component
Date : 2025-07-12 Size : 1kb User : 付静
[Other] strongly-connected DL : 1: 有向图的强连通分量算法的实现，编译、运行及调试环境: Microsoft Visual C-Directed graph strongly connected components algorithm implementation, compiling, running and debugging environment: Microsoft Visual C++
Date : 2025-07-12 Size : 14kb User : honguo
[Graph program] Strongly Connected Components DL : 0: 计算图的强连通分量，C代码实现，windows平台测试通过。(Strongly connected components of a graph)
Date : 2025-07-12 Size : 1.14mb User : 弱弱的

« 12 3 »