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.
图的节点是资源和文字，节点之间用有向边连接，边上用谓词标记。
应用推荐