有向图

Procedure for non-looped code mainly used to judge whether the plan for directed acyclic graph.

此程序为有向无环的代码，主要用于判断给定的图是否为有向无环图。

The aim of learning Bayesian networks is to determine a directed acyclic graph to obtain the causal relationships among variables.

Bayes网络结构是一个有向非循环图，它的边都是有向边，但不存在由有向边构成的环路。

But there are few results on the restricted edge connectivity of de Bruijn digraphs.

在本文第二章我们计算了有向de Bruijn图的限制边连通度，给出：当d≥3，n≥2或d=2，n≥3时，有向de Bruijn图B的限制边连通度为(2d-2)。

The super restricted edge connectivity provides a more accurate index of fault-tolerance of networks.

本文主要研究了有向de Bruijn图的限制边连通度和无向de Bruijn图的超级限制边连通性。

The sufficientcondition is given to prove that Parsons graphs Tb(2, q) is l -- factorable. The author discussesthe directional Parsons graPhs DTb and gives some new conclusions about them. In theend, the author brings forward some new concepts about Parsons graphs and makes someelementary discussions on them.

给出了Parsons图是1—因子可分解的一个充分条件，并证明了部分Parsons图是1—因子可分解的；对有向Parsons图进行了讨论，并给出了一些结论；另外，我们还针对Parsons图提出了一些新的概念，并对其进行了初步讨论。

In chapter four, we study the second isoperimetric connectivity of line graphs and line digraphs. For line digraphs, we show that the second isoperimetric connectivity of strongly connected line digraphs with δ≥ 2 equals its connectivity. For line graphs, we give a sufficient and necessary condition for the existence of the second isoperimetric connectivity, and we show that under the condition that the second isoperimetric connectivity exists, the second isoperimetric con

第四章研究线图和有向线图的第二等周点连通度，得到了如下结果：(1)最小度大于等于2的强连通有向线图的第二等周点连通度等于它的点连通度；(2)对于无向线图，我们给出了第二等周点连通度存在的充要条件；(3)对于第二等周点连通度存在的无向线图，它的第二等周点连通度或者等于限制点连通度或者等于最小度和次最小度的和。

With the use of Petri net simulator,nondirectional trans...

即用Petri网图仿真器把无向运输网络转化为有向运输网络，然后求有向运输网络 G的对偶网络 DG，再用 Petri网图仿真器将对偶网络 DG转换成 Petri图模型，并自动求得 DG最短路(原网络 G的最小割容量)，即运输网络最大流。

In this paper, a lot of research works of algorithms of mining CAD has been done. Many important mine specialty graph operation algorithms have been put forward. The main results are as follows: polygons cut out algorithm, two close polygons mutual, merge and subtract algorithm, polygon vector fill, any vector polygons area calculating and sequence polygons or multifold which has the direction and region area calculating, curve smoothing, graph element search for any region, graph element attrib collect in any region, parallel polygon or vector intersection-point push out or pull in, ore reserves and grade calculating for any type polygon, mine spatial data searching and boundary line tracking and automatic link algorithm etc.

论文在矿山图形算法研究方面做了大量的工作，提出了许多有价值的矿山专业图形运算算法，主要算法有：多边形裁剪算法、闭多边形的加、减、并算法、多边形的矢量填充算法、任意有向多边形、有向多连域、有向多边形序列面积算法、多种曲线光滑算法、任意区域的图元搜索算法、任意区域图元属性提取算法、多边形平行外推/内缩算法、任意多边形储量品位计算、矿山空间数据搜索算法、界线的自动追踪和连接等。

This algorithm recursively enumerated a part of DACG directed segs which had one connected subgraph by using the theory of edge contraction.

为解决有向装配图有向割集的求解，给出一个生成有向装配连接图有向割集的高效算法，该算法优先考虑检查有向割集两个子图间边的方向。

To resolve directed cutset of Directed Assembly Connection Graph, an efficient algorithm for the enumeration of all directed cutsets of DACG was presented. This algorithm recursively enumerated a part of DACG directed segs which had one connected subgraph by using the theory of edge contraction.

为解决有向装配图有向割集的求解，给出一个生成有向装配连接图有向割集的高效算法，该算法优先考虑检查有向割集两个子图间边的方向。

Singer Leona Lewis and former Led Zeppelin guitarist Jimmy Page emerged as the bus transformed into a grass-covered carnival float, and the pair combined for a rendition of "Whole Lotta Love".

歌手leona刘易斯和前率领的飞艇的吉他手吉米页出现巴士转化为基层所涵盖的嘉年华花车，和一双合并为一移交&整个lotta爱&。

This is Kate, and that's Erin.

这是凯特，那个是爱朗。