计算是结构化的，以有向图的方式进行：程序是图形顶点，而通道则作为图的边。
The computation is structured as a directed graph: programs are graph vertices, while the channels are graph edges.
一个简单的例子是创建这样一个图，顶点表示网站中的网页，而边表示页面指向另一个页面的链接。
One simple example is creating a graph where vertices are represented by a website's pages and edges exist between pages containing links to other pages.
例如，布基球的原子键是一种独特的球面结构，球面中有六边形也有五边形(就和足球一样)，碳原子位于顶点处。
Buckyballs, for instance, have a unique spherical structure of atomic bonds that create a hexagon-pentagon structure (like that of a soccer ball) with atoms residing at the vertices.
向一个图片添加两个顶点并将它们通过边连接起来的动作称之为“related _ to”，它是这么实现的。
Adding two vertices to a graph and connecting them through an edge named "related_to" is done as following.
图表：图表是由一组顶点和一组边构成的。
Graph: a graph is composed of a set of vertices and a set of edges.
四边形接受八个参数，代表的是这个四边形的四个顶点。
The quadrilateral takes eight arguments representing the four points of the quadrilateral.
起初，相差的距离微不足道，但两边距顶点处延伸的越远，两条边相差的距离就越大。
Nudge one line out further and the distance grows, negligible at first but the further away from that center point the distance is even greater.
要理解JSON编码的图片，你就需要使用以下模式(schema)来描述顶点和边。
To work with a JSON encoding of a graph one needs to use the following schemas for vertices and edges.
FlockDB将图存储为一个边的集合，每条边用两个代表顶点的64位整数表示。
It stores graphs as sets of edges between nodes identified by 64-bit integers.
对于一个社会化网络图，这些顶点id即用户id，但是对于“收藏”推文这样的边，其目标顶点(destinationid)则是一条推文的id。
For a social graph, these node IDs will be user IDs, but in a graph storing "favorite" tweets, the destination may be a tweet ID.
找到从最新的顶点到其他顶点的所有边，这些顶点不能在树的集合中。把这些边加入优先级队列。
Find all the edges from the newest vertex to other vertices that aren't in the tree. Put these edges in the priority queue.
这样做了以后，要使优先级队列中在任意时刻只保持一条从树中顶点到某边缘点的边就变得容易了。
As it turns out, it is easier to keep only one edge from the tree to a given fringe vertex in the priority queue at any given time.
更改模型的面、边、和顶点的线性距离。
By changing the linear dimension distances from model faces, edges, and vertices.
如果两个顶点被同一条边连接，就称这两个顶点是邻接的。
Two vertices are said to be adjacent to one another if they are connected by a single edge.
“快乐”和“幸福”形成三角形的两边，“极乐”在它的顶点。
Joy and Felicity form two sides of a triangle that has Bliss at its apex.
每次向树中添加顶点后，都要遍历优先级队列查找并删除这样的边。
We could go through the queue looking for and removing any such edges each time we added a new vertex to the tree.
找出权值最小的边，把它和它所到达的顶点放入树的集合中。
Pick the edge with the lowest weight, and add this edge and its destination vertex to the tree.
在程序的算法中，也要确保优先级队列中不能有连接已在树中的顶点的边。
In a programming algorithm we must likewise make sure that we don't have any edges in the priority queue that lead to vertices that are already in the tree.
我们将给出一个类似的圆判据，它说，所有顶点或边系统的某些频域条件可保证整个不确定系统是绝对稳定的。
A circle-like criterion will be given it says that some frequency-domain conditions of all vertex or edge systems guarantee the absolute stability of the whole uncertain system.
每次向树中增加边的时候，一定要确保没有其他边也到达同样的顶点。
Each time we add an edge to the queue, we make sure there's no other edge going to the same destination.
我们将介绍顶点色数和边色数的一些基本性质。
We shall present some of the basic properties of the vertex and edge chromatic Numbers.
三角化曲面上的网格顶点和网格边被抽象为质点-弹簧模型，用来控制网格形状。
Vertices and edges on the triangulated surface are abstracted into a mass-spring model which is used to control the shape of triangles.
如果网络中的一条边被破坏，网络中任意两个顶点之间的最大流一般要减少。
If an edge in a network is destroyed, the value of maximum flow between two vertices in the network is decreased in general.
也就是说，优先级队列中应该只包含一条到达某个第二类顶点的边。
That is, the queue should contain only one edge to each category 2 vertex.
顶点角的两边相交的点。
本文提出的网格简化算法是根据网格顶点的曲率，采用边折叠的方式来减少低频区域的网格顶点密度。
This paper proposes a mesh simplification algorithm based on vertex's curvature, which use edge collapse method to reduce the density of low-curvature region of meshes.
图对称理论刻画了网络中的对象(顶点和边)之间在拓扑结构上的等价关系。
Graph symmetry theory de-scribes the equivalence relationship on topological structure between graph objects (vertices and edges).
图对称理论刻画了网络中的对象(顶点和边)之间在拓扑结构上的等价关系。
Graph symmetry theory de-scribes the equivalence relationship on topological structure between graph objects (vertices and edges).
应用推荐