connected directed graph [计] 连通方向图 ; 连通的有向图
strongly connected directed graph 强连通矢图
rooted connected directed graph 带根连通有向图
k-edge-connected directed graph 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.
算法的输入是一个有向图，产生一个图的强连通分量顶点划分。
In this paper, we introduce the concept of full strongly connected directed graph, give some characterizations of this graph.
本文引进了完全强连通方向图的概念，利用邻接阵给出了等价表征。
应用推荐