全部

1·The other part of the project is an undirected search which is monitoring all of space with a lower sensitivity, using the smaller antennas of NASA's Deep Space Network.

该项目的另一部分是无定向搜索，使用 NASA 深空网络的小型天线，以较低的灵敏度监测所有空间。

2·Undirected graph dot language-syntax generation.

无向图dot语言语法生成。

3·A circ is an undirected graph having only vertices of even nonzero degree.

一广义圈是一无向图，其顶点次数都是非零偶数。

4·Broadcast networks can be expressed by a simple connected undirected graph.

将广播网络用简单连通的无向图表示。

5·For a undirected graph with tree characteristics, we can choose any node as the root.

对于一棵无向树，我们可以选择它的任意节点作为根。

6·A method to build dimensioning model of 2 dimensional drawing based on undirected graph is presented.

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

7·This paper gave a review of recent developments in the study of nullities of undirected simple graphs.

综述无向简单图零度问题近年来所取得的研究进展。

8·This thesis presents a systematic research on two types of graphs, that is undirected graph and mixed graph.

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

9·The algorithm is very simple and suitable for finding all undirected Hamiltonian circuits in general undigraph.

算法简便，适合于求解一般无向图中全部哈密顿回路。

10·The signal in system is transmitted by the undirected graph which is abstracted from experiment circuit diagram.

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

无向

1·Undirected graph dot language-syntax generation.

无向图dot语言语法生成。

2·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.

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

3·Finally, this paper gave simulated annealing algorithm for K-vertex-connected minimal augmentation on arbitrary undirected weighted graph.

最终推出了任意无向加权图K点连通最小扩充的模拟退火算法。

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

5·To enumerate all spanning trees in undirected graphs is an important problem that people frequently encounter in the analysis of network and cycle.

求无向图的生成树是在网络和回路分析中经常遇到的重要问题。

(1)undirected graph无向图