1.
Algorithm for Finding All One-way Sub-graph of Simple Digraph;
简单有向图所有单向分图的求解算法
2.
Digraphs have a simple pictorial representation.
有向图有简单的图形表示。
3.
A digraph D is unilateral.
有向图d是单连的。
4.
The Study of the Hamiltonian Qualities in Digraph;
有向图Hamilton性质的研究
5.
Three Problems about Distances in Graphs and Digraphs;
与无向图及有向图中距离有关的三个问题
6.
The Number of Directed Cycles in a Directed Graph Based on the Arc Determinant
基于弧行列式的有向图中的有向圈数
7.
If (a, b) (ba) then the graph is a directed graph.
如果（a，b）≠（b，a），则这个图是有向图。
8.
THE EXTREMAL DIGRAPHS OF THE kTH UPPER GENERALIZED EXPONENT FOR k-UPPER PRIMITIVE SYMMETRIC DIGRAPHS
上本原对称有向图上广义指数的极图
9.
A Product Selective Disassembly Model Based on Hybrid Directed Graph
面向目标拆卸的产品复合有向图建模
10.
If the edges are ordered pairs of vertices then we get the notions of a directed graph and directed multigraph.
如果边都是顶点的有序对，则得到有向图和有向重图的概念。
11.
An Algorithm for Finding All Euler Cycles in Digraph;
求有向图的所有Euler回路算法
12.
Study of Digraph Corresponding to Prodnct Matrix of Adjacency Matrix of Any Two Circulaut Digraph;
两个有向循环图的邻接矩阵的乘积矩阵对应有向图的研究
13.
Feedback Number of Generalized Kautz Digraphs GK(2,n) and Alternating Group Graphs AG_n
广义Kautz有向图GK（2，n）和交错群图AG_n的反馈数
14.
An optimizing method of flow-chart-based program on directed graphs
基于有向图的程序流程图优化判别方法
15.
We shall abbreviate 'directed graph'to digraph.
我们将把“有方向的图”简称为方向图。
16.
An Algorithm for Generating Directed Cutsets of Directed Cycling Graph Based on Edge Contracted
基于边被收缩图的有向有环图有向割集求解算法
17.
A new GA based drawing algorithm for directed acyclic graphs
一个新的基于GA的有向无环图画图算法
18.
The Structure and Determination of the Set of Reversible Edges in a Directed Acyclic Graph
有向非循环图的可反向边集合的结构与判定