We shall abbreviate the "directed graph" to digraph.

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

We shall abbreviate "directed graph" to digraph.

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

We shall abbreviate 'directed graph 'to digraph.

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

The algorithm is also suitable to an Eulerian digraph.

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

Website structure is described as an un-weighted digraph.

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

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

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

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

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

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

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

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

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

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

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

By using Boolean matrix, some results of power convergence exponent of line digraph are given.

采用布尔矩阵，得到了线有向幂敛指数的一些结果。

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

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

Thus, the problem of efficiently finding the basic set of directed circuits in a digraph is solved.

从而解决了求有向回路基集的有效算法问题。

Special primitive two-colored digraphs whose uncolored digraph consist of two cycles are considered.

研究一类特殊的本原双色有向图，其未着色的有向图包含两个圈。

In this paper a new algorithm for finding all directed Hamiltonian circuits in a digraph is presented.

本文提出一种在有向图中求全部有向哈密尔顿回路的新算法。

Operator recognizes that the single digraph character and the two individual characters are equivalent.

运算符认为该单个二合字母字符与这两个单独的字符是等效的。

The digraph generated can be used in automatic segmentation, ambiguity diminishing and sentence analyzing.

所构造的有向图可以作为机械分词、消除歧义以及进一步分析句子的基础。

A strongly connected digraph D is one in which any vertex can be reached from any other vertex by a directed path.

若有向图D中任何两个顶点是互相可达的，则称D为强连通图。

On the basis of the discussions, an algorithm for finding all directed circuits from walk matrix of digraph is presented.

由此提出一个生成有向图的全部有向回路的算法。

By using the matrix representation of a digraph, some results about the index of convergence and period of a line digraph are obtained.

采用有向图的矩阵表示，得到了线有向图的幂敛指数和周期的有关结果。

Both fault tree and causality diagram are able to express causation by digraph, and both are usually applied to diagnose and analyze system fault.

故障树和因果图都采用图形表示因果关系，都主要用于故障诊断和故障分析。

Note that if not all of the streets are one-way, then we can obtain a digraph by drawing for each two-way road two directed edges, one in each direction.

请注意，如果并非所有的道路都是单行道，那么我们可以在图中为每一条双行道画两条有向边，每条边指明一个方向。

Signed digraph is used to model the dynamic system problems. It is used more and more popular in the modeling of the complicate process of modern warfare.

影响图方法是一种规范化系统动力学建模方法，近年来被越来越多地应用于对复杂战争过程的建模之中。

For computer processing of the directed digraph, it is expressed by a matrix, and then the longest directed paths can be obtained through matrices multiplication.

为了便于计算机处理，将有向图用矩阵表示，通过有向图矩阵的乘法运算搜索最长的有向路径。

In this paper, we show that under the condition that the minimum degree is at least 3, the iterated line digraph of a super-arc-connected digraph is super-connected.

本文证明了，在最小度至少为3的前提下超弧连通有向图的迭代线图是超点连通的。

An approximation algorithm was given to find an out-branching with many leaves in the reduced digraph. Furthermore, some optimization rules were given to improve the out-branching.

对于用近似算法求得的出分枝，又结合前面的规约规则设计了优化规则，以进一步通过优化变换增加出分枝的叶子节点。

Digraph will be constructed by using the dependence of the left of subset's FD. Some nodes will help to decompose a subschema of BCNF. The key of the subschema is the left or left's equivalence.

FD集中根据左部等价形成划分，划分的各子集根据左部的依赖关系形成一个有向图，有向图中每一个节点的FD可能是一个符合BCNF的子模式的FD，其关键字就是各子集的等价左部。

Signed digraph incarnates the coalescent modelling thought of qualitative analysis and quantitative analysis, and the standardized modeling for a complex system can be realized by signed digraph.

影响图方法体现了定性分析与定量分析相结合的建模思想，可对复杂系统进行规范化建模。