有向图

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

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

With this method, the reliability to direct the constraint graph is increased, the computation complexity is reduced, and the cyclic constraint graph can be solved expediently.

应用此方法，可提高约束图有向化的可靠性、降低计算复杂度，且能方便地求解带有循环约束的约束图。

When the consistency is checked, the "distance diagram"is employed. It is concluded that the axioms of a description satisfies the consistency iff there are no negative directed cycles in the distance diagram.

在验证ISITL描述的一致性时采用"距离矢量图"，并认为一个ISITL描述满足一致性当且仅当其距离矢量图上不存在负矢量和的有向回路。

The thesis puts forward intensive definitions of three types of relations and their consistency. By building the corresponding model based on graph theory, it studies the consistency property of relations, and brings forward three static consistency validation methods with the assistance of graphic connectivity, directed path, accessibility et al.

论文对这三种类型的关系及其一致性进行了详细定义和研究，通过建立相应的图论模型，借助于图的连通性、有向路、可达性等，研究了各种关系的一致性性质，提出了三种静态一致性的检验方法。

Network analysis can be realised by means of the graph structure, and faces management is allowed by the planar characteristic of the graph: for any given oriented arc, there is only one face on the right, and one face on the left.

网络分析可以通过图的结构来实现，同时，图的平面特征允许面的操作：对于任意的有向弧，只有一个面位于它的右边，一个位于左边。

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 the algorithm, at first a weighted and undirected graph is constructed among data points in a dataset according to the model, where each data point corresponds to a vertex in the graph, and is regarded as an agent who can move randomly in space.

在此算法中，数据集中的样本点根据改进的随机游动模型，生成有权无向图，其中每个样本点对应图的一个顶点，并且假设每个顶点为可以在空间中移动的Agent。

In this paper, a new type of network graph, in which all transmission paths are oriented and the weight for an arbitrary pair is not the same as for the pair, is defined as an inversable and weight-varied oriented network graph.

本文提出了一种可逆变权有向网络图，在这种网络图中，任意顶点对权与顶点对的权都不同。

In order to get out from the cockamamie work in road route design for designers, on the basis of studying the internal relations among local schemes, local scheme was decomposed to small unit logic schemes; the directed network was used to represent the topological connection; the united data structure of point-arc was used to express a network graph. Based on the shortest path theory, the combinatorial optimization algorithm that can search optimal logical schemes of some targets in the network graph intelligently and can form the whole scheme automatically was put forward.

为了使设计者从道路线路设计的繁重计算统计工作中解脱出来，在研究了局部方案间内在关联的基础上，提出了将局部方案分解为更小单位的逻辑方案，用有向网络图表示逻辑方案间的拓扑关系，采用节点－弧段联合数据结构来表示网络图；同时基于最短路径理论，提出了在网络图中智能化搜索综合指标最优的逻辑方案集，自动形成整体方案的组合优化算法。

In the following, the paper lists node flux balance equation group and loop pressure balance equation group, based on law of conservation of mass and law of conservation of energy, and the relation between flux and pressure elicits, using the law of branch ventilation resistance and the relation of fan performance.

本文根据水电站地下洞室群通风系统的特点，提出了进行节点、分支划分与网络图绘制及分支阻抗计算的原则和方法，利用图论的相关理论将通风系统转化成为点和有向线段表示表示的，并且各个分支影响空气流动的因素由分支的阻抗表示的水电站地下洞室群通风网络图。

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.

这是凯特，那个是爱朗。