查询词典 undirected

In this paper, we mainly study the adjacency spectrum of simple connected undirected graphs. Some results will be given in this thesis.

本文中分两个部分集中反映了作者三年来围绕一般简单连通无向图的邻接谱的界所取得的主要结果，包括两类特殊图类的邻接谱，具体结果如下： 1。

Joining the WTO for China is necessary to keep up with the tideway of the world economy globallization. And it will affect the development of China"s advertising industry in a lot of direct and undirected ways. And this means a lot to the future of China"s advertising industry especially under the circumstance of the new times and the new economy. The advertising industry of China is completely possible to realize a development of jumping style.

加入WT0是顺应世界经济一体化趋势的必然，它对中国广告业发展将产生一系列的直接和间接影响，这对未来中国广告业发展具有深远的意义，尤其是在新时代新经济的背景下，中国广告业完全有可能实现跳跃式的发展。

A solution for signing any directed transitive binary relation is presented by combining the proposed scheme with the undirected transitive signature schemes available.

1引言传递签名是由Micali和Rivest[1]在2002年首先提出的，主要用于对具有传递性的二元关系进行高效签名，这在军事、政治和经济等领域都有重要应用。

I will give you an undirected graph, and you just need to tell me whether the graph is just a circle.

我会给你一个无向图，你需要告诉我这个图标是否仅仅是个圆圈。

This is my design of urban traffic undirected graph procedures inside the location, distance has been given of c...

这个是我设计的城市交通无向图程序，里面的地点、距离已经给定，运行时输入起点和终点即可。

A written test procedures, demonstrating the connectivity of undirected graph visit all the nodes on the operation.

以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。

Ore gave an upper bound of the number of edges of an undirected graph in terms of order and diameter of the graph.

Ore通过图的顶点数和直径给出无向图的最大边数。

The experiment and the analysis show that our algorithm not only can find good approximate partitioning of undirected graph,moreover can reduce the time complexity and the space complexity effectively.

实验及分析表明该算法不仅能找到无向图的近似最优剖分，而且有效地降低了空间复杂度和时间复杂度。

To the adjacent table for the storage structures, to achieve connectivity of undirected graph depth-first and breadth-first traversal.

详细说明：以邻接表为存储结构，实现连通无向图的深度优先和广度优先遍历。

Using this algorithm, arbitrary two vertexes in a given undirected graph can achieve a required vertex-connected degree.

利用该算法可最优地将给定无向图中任意2点达到所要求的点连通度。

Plunder melds and run with this jewel!

掠夺melds和运行与此宝石！

My dream is to be a crazy growing tree and extend at the edge between the city and the forest.

此刻，也许正是在通往天国的路上，我体验着这白色的晕旋。