Transforming an edge affects all connected vertices, faces and polygons.
改变一个边会影响到所有与之相联系的顶点、面、多边形。
Two vertices are said to be adjacent to one another if they are connected by a single edge.
如果两个顶点被同一条边连接，就称这两个顶点是邻接的。
In a graph, a vertex in a tree can be connected to any number of other vertices, provided that no cycles are created.
在图中，树的顶点可以连接任意数量的顶点，只要不存在环即可。
The algorithm takes a directed graph as input, and produces a partition of the graph's vertices into the graph's strongly connected components.
算法的输入是一个有向图，产生一个图的强连通分量顶点划分。
The essay has a study on enumeration question labeled oriented connected graphs with only one cut vertices and labeled oriented connected graphs that all of cut vertices are in same block.
根据标号有向块的指数型生成函数，研究了具有唯一一个割点的标号有向连通图及所有割点都在一个块上的标号有向连通图的计数问题。
The vertices of this 2d figure are then connected with additional lines.
这个二维图形的至高点然后就与另外的线条连接起来。
In this paper we discuss the distribution of vertices of degree 5 on the longest path and cycle and thus give a characterization of contraction critical 5-connected graph in a certain aspect.
讨论收缩临界5 -连通图最长路和最长圈上5度点的分布情况，刻画收缩临界5 -连通图的结构。
The connected matrix of topological relationships between vertices was renewed by occlusion matrix, and the projection drawing defined by connected matrix had no hidden line.
利用遮挡矩阵更新表示顶点间拓扑关系的连接矩阵，得到不含隐藏线的投影图。
The connected matrix of topological relationships between vertices was renewed by occlusion matrix, and the projection drawing defined by connected matrix had no hidden line.
利用遮挡矩阵更新表示顶点间拓扑关系的连接矩阵，得到不含隐藏线的投影图。
应用推荐