片语

undirected simple graph无向简单图

undirected tree graph无向树图

undirected connected graph无向连通图

Undirected Complete Graph无向完全图

undigraph无向图

on undirected itemsets graph无向项集图

undirected weighted graph无向加权图

Undirected Completed Graph无向完全图

undirected weighed graph赋权无向图

weighted undirected liaison graph带权无向连接图

英汉例句

• in this paper, a method to build geometric constraint model of 2 dimensional drawing based on undirected graph is presented.

  本文提出了一种基于图结构描述的二维图形几何约束模型的建立及存储方法。

• the characteristic of mvp is the conversion from netlist to weighted undirected graph and its objective is to improve the efficiency of vlsi partitioner by avoiding partitioning netlist directly.

  mvp系统特点体现在vlsi线网到无向赋权图的转换，避免了剖分算法直接在vlsi线网上进行剖分，提高了vlsi剖分的效率。

• in term of the literature 1 a new algorithm for finding all undirected hamiltonian circuits in an undirected graph is presented in this paper.

  本文在文献的基础之上，证明了一种可求得无向图中全部哈密顿回路的新算法。

• 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 signal in system is transmitted by the undirected graph which is abstracted from experiment circuit diagram.

  根据实验电路图抽象出信号传播无向图，建立系统的信号传播机制。

• firstly, it trains a set of classifiers and constructs a complete undirected graph with weight by using individual and diversity value between individuals.

  首先，训练出一批分类器，利用个体以及个体间的差异性构造出一个带权的完全无向图；

• 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.

  给定顶点赋权的无向图，图的最大权团问题是寻找每个顶点都相邻的顶点子集（团）具有最大权。

• listing 5. builddot.pl — generate dot-language undirected graph

  清单5.builddot.pl — 创建 dot语言无向图

• a method to build dimensioning model of 2 dimensional drawing based on undirected graph is presented.

  提出了一种基于图结构描述的二维图形尺寸标注模型的建立及存储方法。

• with the option check and usage information in place, the program specifies that this is an undirected graph with the graph g{ line.

  检查了选项并準备好使用信息后，程序将通过graphg{行指定该图形是一个无向图。

• this thesis presents a systematic research on two types of graphs, that is undirected graph and mixed graph.

  分别对无向图和混合图这两类图进行了进一步研究。

• 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计算出另外一条不相交路径。

• secondly, based on the graph theory, the network is modeled as an undirected graph g (v , e ), and the rule of trust evaluation is defined by the aid of local information interaction.

  以图论为基础，将网络环境模型化为一个无向图g（v，e），定义了基于本地信息交互的信任评价规则；