英语释义

• two successive letters (especially two letters used to represent a single sound: `sh' in `shoe')

片语

extended digraph扩张有向图

Interrelationship Digraph关联图法

ligature结扎；捆

digraph matrix有向图矩阵

circulant digraph有向循环图

strong digraph[计]

operation digraph工步有向图

cospectral digraph同谱有向图

weighted digraph加权有向图

diconnected digraph双向连通图

英汉例句

• next, fixed traffic detector layout based on digraph theory is proposed to estimate the traffic flow of any urban road section.

  在各种布点方法分析的基础上，结合整个城市路网的交通量估计，提出基于图论的固定型交通检测器预分布；

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

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

• algorithms searching for a directed euler tour in a eulerian digraph and the shortest euler trial in a non-eulerian digraph are also developed.

  除此，还给出了在非有向欧拉图中找一条最短欧拉道路的算法。

• the paper presents the algorithm of finding all the directed circuits on network digraph by means of terminal adjacency matrices to determine their determinants conveniently.

  本文提出了从网络的有向图的终点邻接矩阵求解它的全部有向回路的算法；

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

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

• 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，其关键字就是各子集的等价左部。

• by using boolean matrix, some results of power convergence exponent of line digraph are given.

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

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

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

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

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

• 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.

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

• a fast algorithm for generating chinese word segmentation digraph was given.

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

• we consider the exponents of special nonnegative matrix pairs whose associated digraph consists of two cycles.

  文章主要考虑了特殊非负矩阵对的本原指数，其中与该负矩阵对相应的图包含两个圈。

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

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

• 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.

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

• 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.

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

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

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

• a fast algorithm for generating chinese word segmentation digraph was given. the digraph generated can be used in automatic segmentation, ambiguity diminishing and sentence analyzing.

  给出了一种汉语分词有向图的快速生成算法。所构造的有向图可以作为机械分词、消除歧义以及进一步分析句子的基础。

• by means of the associated digraph of matrices we obtain the necessary and sufficient conditions of whether irreducibly doubly diagonally dominant matrices belongs to non-singular m-matrices.

  借助于矩阵的伴随有向图得到了不可约双对角占优矩阵是否为非奇异m-矩阵的充分必要条件。

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

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