• We shall abbreviate the "directed graph" to digraph.

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

    youdao

  • We shall abbreviate "directed graph" to digraph.

    我们把“有方向的简称为方向

    youdao

  • We shall abbreviate 'directed graph 'to digraph.

    我们把“有方向的简称为方向

    youdao

  • The algorithm is also suitable to an Eulerian digraph.

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

    youdao

  • Website structure is described as an un-weighted digraph.

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

    youdao

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

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

    youdao

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

    在一般向图短路问题没有算法

    youdao

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

    给出一种汉语有向图快速生成算法

    youdao

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

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

    youdao

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

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

    youdao

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

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

    youdao

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

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

    youdao

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

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

    youdao

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

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

    youdao

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

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

    youdao

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

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

    youdao

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

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

    youdao

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

    若有向D任何两个顶点互相的,则称D为连通图。

    youdao

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

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

    youdao

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

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

    youdao

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

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

    youdao

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

    注意如果并非所有道路都是单行道那么我们可以双行道有向,每条边指明方向

    youdao

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

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

    youdao

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

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

    youdao

  • 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前提超弧连通有向图迭代线图超点连通的。

    youdao

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

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

    youdao

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

    youdao

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

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

    youdao

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

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

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定