全部

1·We shall abbreviate the directed graph to digraph.

我们将把“有方向的图”简称为方向图。

2·We shall abbreviate directed graph to digraph.

我们将把“有方向的图”简称为方向图。

3·We shall abbreviate 'directed graph 'to digraph.

我们将把“有方向的图”简称为方向图。

4·The algorithm is also suitable to an Eulerian digraph.

此文所给出的算法同样适用于有向欧拉图。

5·Website structure is described as an un-weighted digraph.

用无权有向图来描述网站结构。

6·Line 1 declares your graph, called g, and its type (a digraph).

第一行声明这个图为g，并且声明了该图的类型(digraph)。

7·There is no good algorithm for finding shortcut in the directed digraph.

在一般有向图中最短路问题是没有好算法的。

8·A fast algorithm for generating Chinese word segmentation digraph was given.

给出了一种汉语分词有向图的快速生成算法。

9·There fore we study the kings of locally semicomplete digraph by its characterization.

文章通过研究局部半完全有向图的结构定理，分类讨论了它中的王。

10·A two-dimensional placement method of minimum area is presented by digraph representation.

本文采用有向图表示、提出一种二维的最小区域布局方法。

有向图

1·A fast algorithm for generating Chinese word segmentation digraph was given.

给出了一种汉语分词有向图的快速生成算法。

2·Finally, the independent analyses and the connections of the two aspects of digraph is discussed.

最后，对有向图的这两个方面进行了独立性分析以及对这两方面的联系进行了论述。