In this paper, we introduce the concept of full strongly connected directed graph, give some characterizations of this graph.
本文引进了完全强连通方向图的概念，利用邻接阵给出了等价表征。
The optimization problem of constructing a K-edge-connected directed graph from any given directed graph by adding a minimum set of edges is studied.
本文研究了以最小边集扩充一个任意有向图为K边连通有向图这一优化问题。
The nodes of the graph are resources and literals, and they are connected by directed edges, which are labeled with predicates.
图的节点是资源和文字，节点之间用有向边连接，边上用谓词标记。
The algorithm takes a directed graph as input, and produces a partition of the graph's vertices into the graph's strongly connected components.
算法的输入是一个有向图，产生一个图的强连通分量顶点划分。
Many documents and papers nowadays have discussed the strong connected component of the directed graph, and the method they adopted is usually Recursion.
现在有一些文献对有向图的强连通分量做了一些讨论，一般采用了递归的方法。
The paper gives out an effective calculating method RMA, which changes an arbitrary non-directed graph into a R-side connected graph with minimum enhancement.
本文提出了一个最小地扩充任意无向连通图为r边连通图的有效算法rma。
The paper gives out an effective calculating method RMA, which changes an arbitrary non-directed graph into a R-side connected graph with minimum enhancement.
本文提出了一个最小地扩充任意无向连通图为r边连通图的有效算法rma。
应用推荐