无向图

Simulation results demostrate that the circuit simulation algorithmperforms better and it is applicable to more kinds of graphs,such as undirected graphs,directed graphs,and mixed graphs.6 At the end of the article,the applications of the algorithm in several fields aredescribed and the value of the method is pointed out.

测试表明，本算法在对几类常见图的同构判定中表现优于Nauty算法，而且可以适用于无向图、有向图及混合图等多种类型的图。6最后给出了电路模拟法在应用领域的成功应用实例，指出了电路模拟法的应用价值。

In this paper, the authors transform the problem of undirected graph drawing to the problem of function optimization, then use genetic algorithms to find approximate optimal solutions of the objective function, and thus obtain a general structure of undirected graph drawing algorithms.

将一般无向图的画图问题转化为函数优化问题，用遗传算法求目标函数的最优解的近似值，从而得到无向图自动画图算法的一个一般框架。

The dimensions system is converted into unidirectional draft,and then we take a new algorithm based on the intelligent route search technique by ransack the abut-matrix of the dimension system to inspect if there are dimensions closures or not in the engineering graphics.

将尺寸标注系统转换成无向图的形式，然后采用一种智能路径搜索的算法，对无向图所对应的邻接矩阵进行遍历，完成对整个标注系统中的所有尺寸标注搜索的过程。

The design is the preparation of plans and the establishment of export, the use of storage structure order to establish a map and undirected graph, Output of adjacency matrix and map the depth and breadth of priority traversal sequence.

本设计是编写关于图的建立以及输出，使用顺序存储结构建立有向图和无向图，输出图的邻接矩阵以及图的深度优先和广度优先遍历次序。

Techniques by compound branch and network ripping to find out all spanning trees of an undirected graph

基于无向图理论，将胶印机输墨系统视为一个复杂的无向图，建立了输墨系统的网络关系图，并采用邻接多重表进行存储。

A semicomplete multipartite digraph is obtained by replacing each edge of a complete multipartite graph by an arc or by a pair of two mutually opposite arcs.

用一条弧或一对方向相反的弧代替完全多部无向图的每一条边所得到的有向图被称为是半完全多部有向图。2002年L。

According to the analysis of min-cut partitioning problem,we give a Cellular Automata model for this problem by applying the cellular automata theory and propose a min-cut optimization algorithm based on this model for bisecting graph.

运用元胞自动机理论，针对无向图剖分优化问题进行了分析和建模，提出了一种元胞自动机模型以及基于该模型的无向图剖分优化算法。

In the project, we found a method for designing a family of 4-optimal double loop networks, established some sharp upper bounds of forwarding indices, distance domination nember, the edge-connectivity and the sharp upper bounds of wide-diameter and fault-tolerant diameter of Cartesian product graphs, the lower bounds of restricted edge-connectivity of digraphs and a sufficient and necessary condition for the restricted edge-connectivity of a graph to be equal to the restricted connectivity of its line graphs; raveled pancyclicity and panconnectivity and obtained the exact values of the mentioned parameters for some well-known networks.

本项目给出最优双环网络的设计方法，找到4紧优双环网络无限族，建立了路由转发指数紧的界，确定了笛卡尔乘积图的边连通度的表达式，宽直径和容错直径紧的上界，给出有向图限制边连通度的下界和无向图的限制边连通度等于它的线图限制点连通度的充要条件，对一些著名的网络确定了上述参数的精确值，讨论了宽直径和容错直径之间的关系，解决了超立方体某些变型网络的泛圈性和泛连通性，得到距离控制数的紧的上界。

According to the distances, the SPWUG algorithm computed the initial partition of the coarsest graph by extending the Laplacian spectral graph theory from the unweighted undirected graph into the weighted undirected graph.

SPWUG算法借助Laplacian矩阵次小特征值对应的特征向量，刻画了节点间相对距离，将基于非赋权无向图的Laplacian谱理论在图的剖分应用方面扩展到无向赋权图上，实现了对最小图的初始剖分。

The model is based on undigraph and the algorithm uses multi ploys to get the skeleton of an image.

它通过专门的分割算法，对图像进行分割并用无向图表示，然后对无向图中各顶点采用多边形近似方法进行骨架化。

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.

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