大家都搜：
[数]有向图
1、pedigree database───系谱数据库
2、digraph th words───有向图
3、digress define───偏离定义
4、digress definition───偏离定义
5、digressed crossword───离题纵横字谜
6、pedigree dog food───纯种狗粮
7、digressing───vi.离题；走向岔道
8、digression synonym───离题同义词
9、digraph───n.合成符，单音双字母；连字
10、digressing means───离题的手段
1、Some theorems about fundamental properties of the digraphs are proved.───证明了几个关于有向图基本性质的定理。
2、Digraphs have a simple pictorial representation.───向图有简单的图形表示。
3、Nonetheless, those alternative tokens that aren't lexical keywords are colloquially known as "digraphs" .───虽然如此，这些不是要害字词汇的候选标记仍被通俗地称为“双连符”。
4、In the literature, vertex ranking numbers are determined for paths, cycles and digraphs.───前人已经知道部分图形的点排序数，像是路径、圈。
5、Special primitive two-colored digraphs whose uncolored digraph consist of two cycles are considered.───特殊的本原双色有向图，其未着色的有向图包含两个圈。
6、Primitive Exponent Set of a Class of Special Two-colored Digraphs───一类特殊双色有向图的本原指数集
7、These include "digraphs" and additional reserved words.───包括“双连符”和额外的保留词。
8、In this paper, the lower bound problems of the maximum genus and the genus distributions of digraphs in orientable surfaces are studied.───本论文主要研究了图的最大亏格的下界问题以及有向图类在可定向曲面上嵌入的亏格分布。
9、This article brings out a method to express data relations based on digraphs structure.───提出了一种基于有向图结构的数据关系的表示方法。
1、An edge crossing minimization algorithm for layered digraphs based on genetic algorithms is present in this article, the code method and the genetic operator are given detailedly.
2、The same ideas apply in digraphs, except that all the edges must point in the same direction.
3、Special primitive two-colored digraphs whose uncolored digraph consist of two cycles arc considered.
4、For the special model of the basic processing is related to increasing rate with rooted forest precedence constraints jobs or series-parallel digraphs jobs, the optimal algorithms are presented.
5、Special primitive two-colored digraphs whose uncolored digraph consist of two cycles are considered.
6、Digraphs have a simple pictorial representation.
7、In this paper, the lower bound problems of the maximum genus and the genus distributions of digraphs in orientable surfaces are studied.
8、The main contents of this thesis involve two aspects of digraphs: the transitivity of multipartite tournaments and the 3— kings-of-kings in semicomplete multipartite digraphs.