vertices的例句大全

A high-efficient algorithm to seek the shortest path arborescence and all shortest paths between any two vertices in DAG is presented.

无回路网络是一类重要的网络，给出在无回路网络中求解最短路树形图和任意顶点对间最短路的高效算法。

Removes the selected vertex from the curved line and reconnects the line between the two adjacent vertices

删除曲线上所选顶点并重新连接相邻两顶点间的线条

The dual bandwidth of a graph G, denoted by ( G), is the maximum value of the minimum labelling variance of any two adjacent vertices in G.

图G的对偶带宽是指图G中相邻两点最小标号差的最大值。

Along with the direction change of the external wrench, the solution sequentially shifts from a vertex to one of its adjacencies, whereas the polytope with all its vertices remains unchanged.

随着外力旋量方向的变化，解不断地从一个顶点转移到它的一个相邻顶点，而凸多面体和它所有的顶点均保持不变。

The simulation results show that Co atoms occupy firstly the central site, then diagonal lines or adjacent vertices positions, finally the vertices and edges as the increase of Co mole fraction. 2.

并且随着Co原子含量的增加，Co原子优先占据中心的位置，其次为对角线或邻近顶点的位置，最后为顶点和棱的位置。

If the graph G had a proper edge colourings and the colouring sets of incident edges at all adjacent vertices of graph G are different from each other, the graph G is said to be a quasi-strong edge colourings.

如果图G有一个合理边上色，使图G的所有相邻顶点的关联边上色集合都互不相同，则称图G为准强边着色。

The adjacent vertex-distinguishing total coloring is the proper total coloring which demands the adjacent vertices with different color sets.

图的染色的基本问题就是确定其各种染色法的色数，图的邻点可区别全染色就是要求相邻顶点具有不同颜色集合的正常全染色。

Therefore the vertices and adjacencies of each vertex are computed in the offline phase. Then the online phase simply searches the adjacencies of the old solution vertex for the new one.

因此，这个凸多面体的所有顶点及每个顶点的相邻顶点都可在离线阶段求出，于是在线阶段只需在当前解的相邻顶点中搜索新的解。

Based on the idea of statistics on the struc-ture, the clique histogram represents the distribution of one vertex with respect to its adjacent vertices, which can capture statistical information on the vertex level.

采用对结构进行统计的思路，首先定义团直方图来表示图的顶点到其邻接顶点之间的分布，捕捉顶点层次上的统计信息。

Given an undirected graph with weights on the vertices, the maximum weight clique problem is to find a subset of mutually adjacent vertices ( i.e., a clique) having the largest total weight.

给定顶点赋权的无向图，图的最大权团问题是寻找每个顶点都相邻的顶点子集（团）具有最大权。

The adjacent vertex-distinguishing incidence coloring is incidence coloring satisfiying the sets of the colors of two adjacent vertices are different.

邻点可区别关联着色的定义是在关联着色的基础上提出的，是使得相邻顶点的颜色集不同的关联着色。

For a given graph G of order n, a routing R is a set of n ( n-1) elementary paths such that every ordered pair of vertices in G are connected by a path in the set.

对于给定的n阶连通图G，一个路由选择R是指G中的n（n-1）条路集，其中每个有序点对都有路集中的一条路连接。

These new vertices, which are adjacent to level 1 vertices, and so on.

这些新的顶点, 这是毗邻的第1级的顶点, 等等.

Calculation of Euclidean Distance between Vertices Based on VCC

图像顶点链编码和顶点欧氏距离的计算

The Wiener index is the sum of distances between all pairs of vertices in a ( connected) graph.

Wiener指数是连通图的点对的距离之和。

Let DKv denote the symmetric complete directed graph with v vertices, the covering number C ( v, m) is a minimum number of covering DKv by m-circuits.

设DKv表示完全有向对称图，C（v，m）表示覆盖DKv的m长有向圈的最小圈数（称为覆盖数）。

Flip the order of triangle vertices so that the system traverses them clockwise from the front.

颠倒三角形顶点的顺序,这样系统可以从正面沿顺时针的方向去遍历他们.