而且，强连通无法推广到强连通分支。
And strong connection is not spreaded to strong connected brance.
利用强连通来研究强紧集。
Strongly compact set was studied by means of strongly connected set.
强连通条件较强，因而这种强连通空间就较少。
Strong connected space is less than normal connected space because of strong conditions.
算法的关键是判断一个结点是否是强连通分量的根。
The crux of the algorithm comes in determining whether a node is the root of a strongly connected component.
这个根结点是在深搜时碰到当前强连通分量的第一个结点。
The root node is simply the first node of the strongly connected component which is encountered during the depth-first traversal.
强连通分量形成了搜索树，他们的根就是强连通分量的根。
The strongly connected components form the subtrees of the search tree, the roots of which are the roots of the strongly connected components.
算法的输入是一个有向图，产生一个图的强连通分量顶点划分。
The algorithm takes a directed graph as input, and produces a partition of the graph's vertices into the graph's strongly connected components.
当从一个搜索树返回时，判断该点是否是一个强连通分量的根。
When the search returns from a subtree, the nodes are taken from the stack and it is determined whether each node is the root of a strongly connected component.
若有向图D中任何两个顶点是互相可达的，则称D为强连通图。
A strongly connected digraph D is one in which any vertex can be reached from any other vertex by a directed path.
本文引进了完全强连通方向图的概念，利用邻接阵给出了等价表征。
In this paper, we introduce the concept of full strongly connected directed graph, give some characterizations of this graph.
利用强连通来研究强紧集。对于强紧集得到了一些普通紧集所不具有的性质。
Strongly compact set was studied by means of strongly connected set. For the strongly compact set, this article gains, a few qualities of which common compact is not possessed.
现在有一些文献对有向图的强连通分量做了一些讨论，一般采用了递归的方法。
Many documents and papers nowadays have discussed the strong connected component of the directed graph, and the method they adopted is usually Recursion.
在活动识别阶段，通过邻接矩阵、可达矩阵和强连通矩阵，对耦合活动进行识别。
In activities identification phase, coupled activities was identified by Boolean operation of adjacent matrix, accessible matrix and strong connected matrix.
然后将无冲突可重复网的极小活标识的配置化为强连通-T图极小活标识的配置。
The second, the assignment of minimal live marking for choice-free repetitive Petri net is transformed into the assignment of minimal live marking for the strong connective T graph.
在细节平衡（detailbalance）的有向强连通加权网络拓扑结构中，我们也得到类似结论。
The similar results can be obtained under the condition that the topology structure of their communication network is a directed weight detailed balance.
研究区葡萄花油层段储层主要为中孔低渗储层，砂体连通性差，非均质性强。
Putaohua oil bearing reservoir primarily is middle prosperous and low permeable with sand bodies of bad conjunction and high heterogeneity.
研究区葡萄花油层段储层主要为中孔低渗储层，砂体连通性差，非均质性强。
Putaohua oil bearing reservoir primarily is middle prosperous and low permeable with sand bodies of bad conjunction and high heterogeneity.
应用推荐