Graph: a graph is composed of a set of vertices and a set of edges.
图表：图表是由一组顶点和一组边构成的。
Create surfaces. We use early created arrays as a set of vertices.
创建表面。我们用之前建立好的数组作为顶点的设置。
The algorithm use a binary digit to divide the vertex set of a non-direction graph, and employ the incident sets of the vertices in the subgraph to produce opposite cut sets.
该算法利用二进制数分割无向图的顶点集，通过对子图各顶点的关联集的运算产生相应的割集。
A simple linear gradient is easy: draw a quadrilateral polygon with two of its vertices set to one color and two of its vertices set to a second color.
简单线性梯度很容易：画一个四边形多边形的两个顶点设置为一个颜色和它的两个顶点设置为第二个颜色。
Graphics primitives, such as points, lines, and triangles, are defined as an ordered set of vertices.
基本图形，如点，线，和三角形，被定义为一个有序的顶点集合。
A proper edge coloring of a graph is called an adjacent strong edge coloring if no two of its adjacent vertices are incident with edges colored by the same set of colors.
如果在一个图的正常边着色中，相邻两点关联的边集所着的颜色集合不同，则称此正常边着色为相邻强边着色。
By inserting a new set of medium vertices in a complete bipartite graph, we extend Pigeon-hole formula to general pigeon-hole formula.
鸽巢公式的一个真值指派可以用一个边带标记的完全二分图表示。
By inserting a new set of medium vertices in a complete bipartite graph, we extend Pigeon-hole formula to general pigeon-hole formula.
鸽巢公式的一个真值指派可以用一个边带标记的完全二分图表示。
应用推荐