无向图

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

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

The set of jobs is specified using a directed acyclic graph, where each job is a node in the graph.

任务集是通过一个有向无环图来定义的，每个任务就是图中的一个节点。

As the graph of Bayesian network is required to be a directed acyclic graph, which was changed during the constructing process, checking for cycle is need in the interaction.

由于贝叶斯网的网络结构要求为一有向无环图，并且此图在交互建网过程中时刻变化，所以要在交互过程中反复检测环路是否存在。

However the reachability matrix is difficult to get. It is proved that there is no need to calculate the reachability matrix fur a Directed Acyclic Graph.

证明了对于一类特殊的有向图即有向无环图，应用解释结构建模法无须求解可达矩阵亦可保证建模结构化的实现。

Let G be a finite group, and S a subset of G not containing theidentity element 1. The Cayley digraph Cay on G with respect to S is definedas a directed graph with vertex set G and edge set {|g∈G, s∈S}. IfS~(-1)=S, then Cay is undirected and in this case, we view two directededges and as an undirected edge {u, v}. Obviously, the right regularrepresentation R of G, the acting group of G by right multiplication, is asubgroup of the full automorphism group AutCay(G, S of Cay.

给定有限群G，设S是G的不含单位元1的子集，群G关于子集S的Cayley有向图Cay是一个以G顶点集合，而以｛|g∈G，s∈S｝为边集合的有向图，特别地，若S~(-1)=S，则X=Cay是无向的，此时我们把一条无向边｛u，v｝等同于两条有向边和，易见，群G的右正则表示R，即G在G上的右乘作用，为图Cay的全自同构群AutCay

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

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

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的最小割容量)，即运输网络最大流。

This can be established without a map to the right, then seeking the shortest route into the problem for a map of the rest of Vertex Vertex all the shortest path probl

这样就可以建立一个无向有权图，那么求最短的运输路线问题就转化为求图中一顶点到其余各个顶点的最短路径问题了。

In this dissertation, we discuss mainly the existence problem of large sets of Hamiltoncycle and path decompositions.

本文主要研究完全图、完全二部图、完全对称有向图及完全对称有向二部图上的无向Hamilton圈和Hamilton路分解的大集问题以及几乎Hamilton圈和几乎Hamilton路分解的大集问题。

However, as the name（read－only memory）implies, CD disks cannot be written onorchanged in any way.

然而，正如其名字所指出的那样，CD盘不能写，也不能用任何方式改变其内容。

Galvanizes steel pallet is mainly export which suits standard packing of European Union, the North America. galvanizes steel pallet is suitable to heavy rack. Pallet surface can design plate type, corrugated and the gap form, satisfies the different requirements.

镀锌钢托盘多用于出口，替代木托盘，免薰蒸，符合欧盟、北美各国对出口货物包装材料的法令要求；喷涂钢托盘适用于重载上货架之用，托盘表面根据需要制作成平板状、波纹状及间隔形式，满足不同的使用要求。