查询词典 graph

The concept"attachable graph"and the enumeration method of pates and circuits on the graph are proposed. With the graph, the gear arrangement problem can be solved. The new method and procedure of GLM type synthesis are presented. With general type synthesis method, Attachable Linkage Kinematic Chain could be generated.

用一般平面连杆运动链类型综合的方法可生成ALKC，然后通过在ALKC上配置齿轮模块得到NGLKC，再在NGLKC上用一定方法设置焊点生成WGLKC，进而选取机架和原动件，即可完成GLM的类型综合。

Basing on this, this paper proposes a generalized shortest path method. That is, by constructing an intermodal-network multi-ply graph which interrelates the data and information in transit with the nodes and sides of the graph, adding virtual origin and destination stations to the graph, and then analyzing transport costs and transfer costs, this paper applies the Dijkstra algorithm to solve the intermodal optimal transport path problem so as to get the intermodal transport plan with the least generalized costs.

在此基础上，提出一种求解最佳运输路线的广义最短路法，即通过构建多式联运网络多重图，将运输过程中的数据、信息和图中的节点、边关联起来，然后对运输费用和中转费用进行分析估计，并通过在联运网络图中加入虚拟的发、到站，使得该问题可用Dijkstra算法进行求解，从而获得广义费用最少的联运方案。

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.

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

The commit objects form a directed acyclic graph, because they have parents, and the graph of commit objects is acyclic (there is no chain which begins and ends with the same object).

交付对象是按一个单向非环路是图的形式来组织的，因为他们有父辈，以及非环路视图（不存在开始和结尾都是同一个对象的情况）。

The spectral graph theory is one of the main branches in algebraic graph theory, it is mainly concerned with the adjacency spectrum and the Laplacian spectrum.

图的谱理论是代数图论中的一个重要课题，主要涉及图的邻接谱与图的Laplacian谱的研究。

The study of graph spectra is an important direction of research in algebraic graph theory, and its main object of study is the adjacency spectrum and the Laplacian spectrum.

对图谱的研究是代数图论中的一个重要研究方向，其主要研究对象是图的邻接谱与图的Laplacian谱。

In the third chapter, we shall define the concepts of the adjacent vertex distinguishing incidence coloring and the adjacent vertex distinguishing incidence chromatic number of graphs: For graph G, let Q_u={|u"∈N}U{|u∈N},σ: I→C is a k- incidence coloring of graph G, C_u denotes the set of colors assigned to Q_u.

在第三章中我们将定义图的邻点可区别关联着色及邻点可区别关联色数：对图G，设Q_u={|u"∈N}∪{|u∈N}，σ：I→C为图G的k-关联着色，C_u表示着在Q_u上的色集。

The study of molecular topological indices and the invariants of molecular graph is one of the most active area in the modern chemical graph theory.

分子拓扑指数以及分子图的不变量的研究是现代化学图论中最活跃的研究领域之一。

On this foundation, the paper proposes distinguishing the shape of the graph by using the graph area and the perimeter ratio scope.

在此基础上提出了利用图形的面积和周长的比值范围来识别出图形的形状。

Salt is good, but if the salt becomes flat and tasteless, with what do you season it?

14：33 盐本是好的，盐若失了味，可用什么叫它再咸呢？

He reiterated that the PLA is an army of the people under the leadership of the Communist Party of China.

他重申，人民解放军是在中国共产党领导下的人民军队。