基本图形，如点，线，和三角形，被定义为一个有序的顶点集合。
Graphics primitives, such as points, lines, and triangles, are defined as an ordered set of vertices.
一个图称为点传递图，如果它的全自同构群在它的顶点集合上作用传递。
Firstly, we obtain some equivalent characterization for Cayley graphs of completely simple semigroup which is vertex-transitive.
FlockDB将图存储为一个边的集合，每条边用两个代表顶点的64位整数表示。
It stores graphs as sets of edges between nodes identified by 64-bit integers.
从一个顶点开始，把它放到树的集合中。然后重复做下面的事情。
Start with a vertex, put it in the tree. Then repeatedly do the following.
找到从最新的顶点到其他顶点的所有边，这些顶点不能在树的集合中。把这些边加入优先级队列。
Find all the edges from the newest vertex to other vertices that aren't in the tree. Put these edges in the priority queue.
找出权值最小的边，把它和它所到达的顶点放入树的集合中。
Pick the edge with the lowest weight, and add this edge and its destination vertex to the tree.
利用集合的思想对顶点着色算法进行研究，得到一种简洁的顶点着色算法。
Using the thought of mathematical set, this paper is intended to carry out a study into the algorithms for vertex coloration. Therefore, a simple algorithm can be found out.
若从一个图中去掉某些顶点后得到的导出子图是无圈图，则所去的那些顶点组成的集合就是原图的反馈点集。
A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is acyclic after removing the vertex subset from the graph.
如果从一个图中去掉某些顶点后得到的导出子图是无圈图，则所去的那些顶点组成的集合就是原图的反馈点集。
A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is a forest after removing the vertex subset from the graph.
如果从一个图中去掉某些顶点后得到的导出子图是无圈图，则所去的那些顶点组成的集合就是原图的反馈点集。
A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is a forest after removing the vertex subset from the graph.
应用推荐