查询词典 directed graph

The paper provides a method,which can automatically search next path of outline based on clockwise tread and search next path of closed graph based on counter－clockwise tread.The method improves the ancient method and increases graph making efficiency and intelligentize of CAD system.

该文提出基于顺时针行走方向搜索外轮廓下一条路径和基于逆时针行走方向搜索封闭图形下一条路径的原理和算法，改进了以往算法的不足，对提高CAD系统的图形生成效率以及系统的智能化程度等方面有着重要的意义。

Meanwhile, the experiments show that the multi-level swarm intelligence refinement algorithm is better than the multi-level tabu search refinement algorithm, especially in view of the probability that the approximate global minimum partition of the coarser graph may be the local minimum partition of the finer graph. Furthermore, the experiments show that the multi-level ant colony optimization refinement algorithm achieves more performance improvement than the multi-level particle swarm optimization refinement algorithm, using the gain of vertex more effectively.

实验数据反映出，针对最小图上的全局最优剖分可能是初始图的局部最优剖分、粗化图上的全局最优剖分可能是细化图的局部最优剖分的情况，基于群智能的多水平迁移优化算法相比基于禁忌搜索的多水平迁移优化算具备更强的逃离局部最优的能力；基于蚁群的多水平迁移优化算法相比基于微粒群的多水平迁移优化算法，对收益值的启发信息更为有效地利用，取得最佳的性能改进。

Let G be a double-outer plane graph, V, E, F be the set of points, edge and face, a plane graph G is k-total colorable, if the elements of V E can be colored with K-colors, any two distinct adjacent or incident elements receive different colors.

设G是一个双外平面图，V，E，F分别为双外平面图G的点集，边集和面集。G的全色数X是使得V∪E中的任意两个相邻或相关联的元素间均染不同颜色的最少颜色数。

The graph coloring problem is one of important branchs of graph theory.

图的着色问题是图论中的一个重要研究领域。

And based on traditional graph coloring register allocation,a new algorithm to construct unified and simplified interference graph utilizing complementary predicate is presented,which can reduce spill code.

最后在YHFT-DSP/700芯片的编译器上对所提优化方法的有效性进行了验证。1引言指令级并行(ILP，Instruction Level Parallelism)一直以来都是编译领域的一个研究热点。

Furthermore, the complexity between the relationships of synchronizability and network structural parameters are discussed via two simple graphs, and the effects of complementary graph, edge-addition and graph operation on the synchronization of complex networks are elaborated.

其次以两个简单图指出同步能力与网络结构参数的关系复杂，并给出补图与加边对同步研究的意义，然后给出图运算在复杂网络同步中的作用。

In this paper the level of elementary graphs is explored, and the D^2 of any non-bipartite elementary graph is proved to be a complete graph.

本文研究了基本图的水平，证明了对于任何非二部的基本图，它的D^2是一个完全图。

And two important growing ways: star-like graph growth and complete graph growth.

增长和择优机制是无标度网络中两个最重要的演化机制，已发现比较重要的择优机制有度择优和秩次择优，比较重要的增长方式有星形图增长和完全图增长。

For example, say we wish to know if two vertices in a graph of n vertices are in the same connected component of the graph.

举个范例，我们希望知道一个有 n 个顶点的图形中的两个顶点是否位於图中同一个连接元件。

A graph in which any two vertices are connected by a path is called connected graph.

一个图中如果任意两个顶点都有一条路相连，则称之为连通图。

If you were not , and OS X just booted normally, have no fear.

如果你没有，和OS X刚刚启动通常，没有恐惧。

I only want to preserve our all .

我只想保存好我们的一切