英语人>网络例句>顶点 相关的搜索结果
网络例句

顶点

与 顶点 相关的网络例句 [注:此内容来源于网络,仅供参考]

Suppose that G = V(G,E is a connected, simple graph with vertex set V and edge set E.

设G是一个连通简单图,V,E分别表示图G的顶点集和边集。

The Bi-Cayley graph BC of G with respect to S is defined as the bipartite graph with vertex set G ×{ 0,1} and edge set {(g, 0)(sg, 1): g ∈ G,s ∈ S}.

Bi-Caylcy图BC是一个二部图,它的顶点集为G×{0,1,边集为{(g,0)(sg,1):g∈G,s∈S。

If you'd like, you can change the vertex colors and see the effect.

如果你喜欢,你可以改变顶点的颜色看看效果。

You can modify your vertex groups at any time.

不过你可以在任何时候修改你的顶点组。

If no such vertex is found, 1 is returned.

如果没有这样的顶点,就返回-1。

First, let's define our vertex format.

首先,让我们定义我们的顶点格式。

Start with a vertex, put it in the tree.

从一个顶点开始,把它放到树的集合中。

At first we need to get normals for each triangle vertex, but how to achieve this?

首先我们需要对每个三角形顶点法线,但如何实现这一目标?

The second parameter is the index of the first vertex to load.

第二个参数是加载第一个顶点的索引。

A vertex mapping of graph is a binary mapping from to , that is,.

定义在图上的顶点映射是到上的一个二元映射,即。

第58/87页 首页 < ... 54 55 56 57 58 59 60 61 62 ... > 尾页
推荐网络例句

She gently rebuff ed him, but agreed that they could be friends

她婉言拒绝了,但同意作为朋友相处。

If in the penal farm, you were sure to be criticized.

要是在劳改农场,你等着挨绳子吧!

Several theories about reigniting and extinguishing of the arc have been refered.

本文综合考虑了几种电弧重燃和熄灭理论。