查询词典 vertices

In general,given two vertices V and W in a graph,it is not always possible to find a path connecting them;such a path will exist only when the graph is 'in one piece'.

D8 |一般而言，给定图的两个顶点V和W并非总能找到连接它们的路；只有当图是"在一块中"时，这样的路才存在。

Comment: A graph is CONNECTED if there is a path connecting every two vertices.

说明：如果任意两个顶点之间都存在路径相连，那么称这个图为"连接图"

In general,given two vertices V and W in a graph,it is not always possible to find a path connecting them（see Fig.3-9）;such a path will exist only when the graph is"in one piece".

一般而言，给定图的两个顶点V和W并非总能找到连接它们的路（如图3-9所示）；只有图"在一块之中"时，这样的路才存在。

In Graph Theory,we shall also be interested in connected graphs in which there is only one path connecting each pair of vertices;such graphs are called trees（generalizing the idea of a family tree）.

在图论中，人们还对树感兴趣，树是每一对顶点间只有一条路的连通图。

For an uncertain system described by convex combination of interval polynomials, its Hurwitz-stability can be guaranteed by certain subset composed of vertices and edges.

对于由区间多项式的凸组合描述的不确定系统，它的Hurwitz稳定性可由某个仅由顶点和棱边构成的子集来保证，且此集合的大小与系统的维数无

Each pixel on multispectral and hyperspectral imagery can also be regarded as one vector and the whole image is a convex cone formed by a number of nonnegative discrete vectors,so endmember selection is equivalent to search for the vertices of a convex cone.

遥感图像中的每个像元都可以看作一个多维向量，整幅影像看作由离散的非负向量构成的凸锥，通过寻找凸锥的角点来自动获取图像的端元。

The algorithm makes full use of the order of vertices of the convex polygon,so that the minimum time complexity of the algorithm can be achieved.

该算法充分地利用了凸多边形顶点的有序性，使算法的时间复杂度达到最小。

The Convex Hull of a given points P in the plane is the unique convex polygon whose vertices are points from P and contains all points of P.

在给定的点在平面P凸包是独特的凸多边形的顶点从P点，并包含换句话说P的所有点的集合P点是最小凸集凸壳含有体育

A convex polyhedron has 20 vertices and each of its faces is a pentagon.

一个凸多面体的每个面都是五边形。若它有20个顶点，它有多少条边？

It can be solved in O(n 2) time for single convex polyhedron obstacle (here n is the total number of vertices of polyhedron).

文章主要研究了k＝ 2情形下的最短路问题，提出一个在O（n2）时间内解决该问题的算法。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。