查询词典 adjacent vertex

Aiming at the multiple loop structures in quality management process network, an improved graph pattern mining approach based on Apriori algorithm is put forward, where a frequent pattern of size k, denoted as G, is joined with another frequent pattern of size k, denoted as G, to form a candidate frequent pattern of size (k+1), if there exists a source vertex s in G and a sink vertex e in G such that the graph derived from G by subtracting node s equals with the graph derived from G G by subtracting node e.

采用基于APriori方法的频繁活动序列挖掘算法，认为k-频繁图集中，当一个图减去其中的一个源顶点后，如果所得到的图与另一个图减去其中的一个沉顶点后的图相同时，可以连接生成一个(k+1)-候选频繁图，从而减少了传统Apriori算法迭代过程中生成的冗余候选频繁图的数目。

In order to develop a new method for creating such an object normal form, the meaning of a vertex of the directed graph is extended, such that it is not only a simple vertex, but also a directed graph.

为了研究新的对象范式生成方法，对有向图顶点的含义进行了扩充，使其不仅可以是一个简单的顶点，还可以是一个有向图。

For example,the graph in Fig.3-5 is Hamiltonian（a possible path being P→Q→R→S→T→P）but is not quite Eulerian,since any path which includes every dege exactly once（e. g.P→Q→T→P→S→R→Q→S→T）must end up at a vertex different from the initial vertex.

例如，图3-5所示是一个哈密尔顿图（存在一条路P→Q→R→S→T→P）但不是一个欧拉图，这是因为图中任何包含所有边一次且仅一次的路（如P→Q→T→P→ S→R→Q→S→T）都不能回到原出发顶点。

As a minimum, a vertex shader must output vertex position in homogeneous clip space.

顶点着色器至少要输出顶点在齐次空间中的位置。

Vertex a is the initial vertex and b is the terminal vertext.

a顶点是始端顶点，而b是末端顶点。

For example,we shall be discussing graphs which contain paths which include every edge or every vertex exactly once,ending up at the initial vertex [7];such graphs will be called Eulerian and Hamiltonian graphs respectively.

例如，我们将讨论这样一些图，图中存在包含所有边或所有顶点一次且仅一次而回到出发顶点的路，我们分别称之为欧拉图和哈密尔顿图。

For Example,we shall be discussing graphs which cintain paths which include every edge or every vertex exactly once,ending upa at the initial vertex;such graphs will be called Eulerian and Hamiltonian graphs respectively.

例如，我们将讨论这样一些图，图中存在包含所有边或所有顶点一次且仅一次而回到出发顶点的路，我们分别称之为欧拉图和哈密尔顿图。

Is said to be hyperconnected if for every minimum vertex cut C of G, G - C has exactly two components one of which is an isolated vertex.

称为超连通的，若对每个最小割集C；G-C恰有两个连通分支，且其中之一为孤立点。

Similarly, a graph X is said to be hyper-connected if every minimum vertex cut creats two components, one of which is an isolated vertex. In [8], D.Wang and J.

类似地，一个图X称为是超连通的，如果对每一个最小割集C，都有X—C只有两个连通分支，且其中一个连通分支为孤立点。

The minimum weight vertex covering set and the maximum weight vertex independent set in the bipartite graph.

最大密度子图；4。二分图的最小点权覆盖集和最大点权独立集。

In contrast to the ubiquitous rising-sun-with-rays military flag of the Japanese, Chinese banners and ensigns feature a range of designs.

与遍地都是的太阳军旗不同，中国人的旗帜和徽章设计得各式各样。

From their small corner of Feng's Guangzhou headquarters -- a jumble of pink leashes, squeezable rubber steaks, and plastic doggy Santas for Fido's stocking -- Soleil's designers come up with at least five new products a month.

从Feng 设在广州总部的产品展示柜台上可以看到，Soleil的设计师每月至少设计出5件新产品。