Undirected graph dot language-syntax generation.
无向图dot语言语法生成。
A circ is an undirected graph having only vertices of even nonzero degree.
一广义圈是一无向图，其顶点次数都是非零偶数。
Broadcast networks can be expressed by a simple connected undirected graph.
将广播网络用简单连通的无向图表示。
For a undirected graph with tree characteristics, we can choose any node as the root.
对于一棵无向树，我们可以选择它的任意节点作为根。
A method to build dimensioning model of 2 dimensional drawing based on undirected graph is presented.
提出了一种基于图结构描述的二维图形尺寸标注模型的建立及存储方法。
This thesis presents a systematic research on two types of graphs, that is undirected graph and mixed graph.
分别对无向图和混合图这两类图进行了进一步研究。
The signal in system is transmitted by the undirected graph which is abstracted from experiment circuit diagram.
根据实验电路图抽象出信号传播无向图，建立系统的信号传播机制。
In this paper, a method to build geometric constraint model of 2 dimensional drawing based on undirected graph is presented.
本文提出了一种基于图结构描述的二维图形几何约束模型的建立及存储方法。
Even on the form to input an undirected graph edge, the establishment of the adjacency matrix to determine whether the connectivity graph (a).
以偶对的形式输入一个无向简单图的边，建立该图的邻接矩阵，判断图是否连通(A)。
The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graph partition problem.
将表示电路的超图转化成带权值的无向图，从而将电路二等分问题转化成图的划分问题。
From the analysis of a practical example, the article derives that the poly-solution structure of the maths model of the general linear goal programming is an undirected graph.
从一实例分析出发，推导出一般线性目标规划数学模型的多重解结构为一无向图。
Besides, the compression mechanism of Dynamic Bit Vector (DBV) was used to store the edge weights in undirected graph to improve the spatial storage efficiency of the algorithm.
此外，采用一种动态位向量(DBV)的压缩机制对无向图中边的权重进行压缩存储，以有效地提高算法的空间存储效率。
This method USES intermediate nodes' location information to create undirected graph at destination node, and USES Breath-First Search (BFS) algorithm to find another disjoint path.
本文提出的方法在目的端利用获得的中间节点位置信息来生成无向图，再利用广度优先遍历算法BFS计算出另外一条不相交路径。
Given an undirected graph with weights on the vertices, the maximum weight clique problem is to find a subset of mutually adjacent vertices (i. e., a clique) having the largest total weight.
给定顶点赋权的无向图，图的最大权团问题是寻找每个顶点都相邻的顶点子集(团)具有最大权。
The MSS problem seeks to compute a set of vertex-disjoint simple paths in an undirected bipartite graph under certain constraints.
MSS问题的目标，是在一个二分无向图上寻找由互不相交的路径所构成的集合，并要求这个集合满足一些特定的条件。
Finally, this paper gave simulated annealing algorithm for K-vertex-connected minimal augmentation on arbitrary undirected weighted graph.
最终推出了任意无向加权图K点连通最小扩充的模拟退火算法。
The black and white salesman problem (BWTSP) is a new NP-hard problem, which can be divided into the undirected BWTSP and the directed BWTSP according to the symmetry of edges in graph.
黑白旅行商问题(BWTSP)是近年来出现的新NP -难解问题，根据图中边是否对称可以分为无向BWTSP和有向BWTSP两种。
The output of the algorithm is largest chain graph, which just orienting the statistical distinguishable edges, keep the indistinguishable edges undirected.
算法输出结果为最大链图，该图仅对统计可分的弧进行定向，对统计不可分的弧保留无向的特性。
In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edge disjoint cycles in g.
给定一个无向连通图g，圈包装问题就是求g的边不相交圈的最大数目。
In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edge disjoint cycles in g.
给定一个无向连通图g，圈包装问题就是求g的边不相交圈的最大数目。
应用推荐