到顶点

Given an undirected graph,the vertex coloring problem is to assign a different color for vertex mutually adjacent.

图的顶点着色问题是指无向图中任意两个相邻顶点都分配到不同的颜色，这个问题是著名的NP 完全问题，没有非常有效的算法。

All the input data for each vertex in the individual primitive is available (i.e. 3 vertices for triangle), plus adjacent vertex data if applicable/available.

每个独立图元的每个顶点的所有输入数据都可以取到，并且在预先申明的情况下还附加了邻接顶点信息。

Aiming at the multiple loop structures in quality management process network, an improved graph pattern mining approach based on Apriori algorithm is put forward, where a frequent pattern of size k, denoted as G, is joined with another frequent pattern of size k, denoted as G, to form a candidate frequent pattern of size (k+1), if there exists a source vertex s in G and a sink vertex e in G such that the graph derived from G by subtracting node s equals with the graph derived from G G by subtracting node e.

采用基于APriori方法的频繁活动序列挖掘算法，认为k-频繁图集中，当一个图减去其中的一个源顶点后，如果所得到的图与另一个图减去其中的一个沉顶点后的图相同时，可以连接生成一个(k+1)-候选频繁图，从而减少了传统Apriori算法迭代过程中生成的冗余候选频繁图的数目。

These are called vertex focal distance because they are measured from the vertex of the lens surface to the lens focal point, The focal powers corresponding to them are the back and front vertex powers.

13从透镜的表面到焦点的距离被称为顶点焦距，是以透镜的前后顶点为起点测量的。与之相对应的屈光度称为前后顶点焦度。

In this paper was obtained minimum point of sums of distances to isosceles triangle certainly was in median line of base of the triangle,and minimum point of quadratic sums of distances to every vextex in general triangle just was bara-center ofthe triangle.

对等腰三角形，得到了到各顶点距离之和的最小值点必在底边的中线上；对一般的三角形，获到了到各顶点距离平方和的最小值点就是三角形的重心。

The vertex is ordered pair composed of agent and autonomic grid service.The graph is constructed by layers of the vertex on mapping from task posets to service set.

图中的顶点是由Agent和自主网格服务组成的序偶，构造算法由任务偏序集到服务集的映射，逐层构造图中的顶点。

The paper improves it in the following two aspects by analyzing and studying the basic principles and procedures of Dijkstra primary algorithm.

文章通过对Dijkstra原始算法的基本原理和步骤进行分析研究，做如下改进：1、从已通过顶点集到未通过顶点集的可能存在的多条最短路径中，不丢弃任何一条最短路径。

Vertex labeling is a mapping that maps the vertex set into integer set. On the other hand, edge labeling maps edge set into integer set.

一个图的顶点标号是图的顶点集到整数集的映射，而边标号则是图的边集到整数集的映射。

This finds all the edges satisfying the condition that the first vertex index is less than the second vertex index when the direction from the first vertex to the second vertex represents a counterclockwise winding around the triangle to which the edge belongs.

当从第一个顶点到第二个顶点的方向表示该边所属三角形的逆时针方向时找到所有符合第一顶点的索引比第二个顶点索引小的边。

Because prices rose only one point in the process of buying is wrong, that is, prices rose to a peak time.

因为价格上升的过程中只有一点是买错了的，即价格上升到顶点的时候。

On the other hand, the more important thing is because the urban housing is a kind of heterogeneity products.

另一方面，更重要的是由于城市住房是一种异质性产品。

Climate histogram is the fall that collects place measure calm value, cent serves as cross axle for a few equal interval, the area that the frequency that the value appears according to place is accumulated and becomes will be determined inside each interval, discharge the graph that rise with post, also be called histogram.

气候直方图是将所收集的降水量测定值，分为几个相等的区间作为横轴，并将各区间内所测定值依所出现的次数累积而成的面积，用柱子排起来的图形，也叫做柱状图。