Undirected英文翻译_含义_读音_Undirected例句_月亮词典

Undirected

英音[ ˌʌndɪˈrektɪd ] 美音[ ˌʌndɪˈrektɪd ]

无向

常用释义

词性释义

adj.

无目标的，未受指导的；无收件人姓名的

例句

全部
无向

An undirected connected graph with no cycles is called a tree. A vertex with degree equal to one in a tree is called a leaf.

一个无环无向连通图称为一棵树。树中一个度为一的点称为叶子结点。

Four participants in the "undirected prayer" group had, without prompting, decided to pray for their romantic partners on a daily basis.

4名参与“无导向祈祷”小组的受测学生在没有被要求的情况下，决定每天为他们的情人祈祷。

Such undirected orientation is called kinesis.

这种被称为无向方向室壁运动。

Establishment of the adjacency matrix storage on the already established undirected graph depth first and breadth-first traversal operation.

建立无向图的邻接矩阵存储；对已经建立的无向图进行深度优先和广度优先遍历操作。

Kinesis refers to random, undirected movement, while taxis refers to movement in relation to a stimulus.

室壁运动是指随机的，无向运动，而的士指运动与刺激。

To avoid detail we shall use the latter symbol for both undirected and directed graphs and rely on the context for clarity.

为了避免琐碎，对无向图和有向图我们都采用后一符号，而靠上下文加以澄清。

map storage structure definition and graph types to create graph: directed graph, undirected graph, to the network without the network.

图的存储结构的定义和图的创建图的种类有：有向图、无向图、有向网、无向网。

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

试写一个程序，演示在连通的无向图上访问全部节点的操作。

Essentially his argument is that living things are complex in a way that undirected , random processes could never produce.

基本上，他的论证是，生物很复杂，复杂得无法以没有方向的随机过程制造。

Kinesis - Random, undirected movement.

室壁运动-随机，无向运动。

using adjacency list undirected graph storage to achieve the breadth-first traversal.

采用邻接表存储实现无向图的广度优先遍历。

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

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

Aim To discuss the matching equivalence of the simple undirected graph.

目的讨论简单无向图的匹配等价问题。

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

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

Further, it could be broken down into two types: directed and undirected.

并且，它还可以分为两种类型：直接的和间接的。

An undirected graph has an even number of vertices of odd degree.

奇数度顶点有偶数个。

Let G = (V, E) be a simple undirected graph.

G=（V，E）为一简单且无方向图形。

it 's also far more tolerant of bottom-up tinkering and undirected trial and error .

这也是更宽容的自下而上的修修补补，杂乱的尝试和错误。

For some lower animals, movement is undirected and random, such as a Paramecium blundering about its environment.

一些低等动物，运动是无向和随机，如草履虫浮躁其环境。

Essentially his argument is that living things are complex in away that undirected, random processes could never produce.

他的主要论点是，无主导的、随机的过程不能产生生物的复杂性。

Listing 5 shows the buildDot. pl program for generating undirected graphs.

清单5展示了创建无向图的buildDot.pl程序。

The Adjacency Edge Growth Algorithm AEG for Determining Hamilton Cycle of a Simple Undirected Graph

确定简单无向图中Hamilton圈的邻接边增长算法

Discussions about the Two Algorithms for Finding the Minimal Spanning Tree of an Undirected Weighted Graph

求无向赋权图最小生成树的两种算法的探讨

Refined Genetic Algorithm for the Augmentation of Undirected Weighted Graphs to k-Vertex-Connected Graphs

基于改进遗传算法的无向加权图的k点连通扩充

An Optimal Routing Algorithm for a Class of Undirected Double Loop Networks

一类无向双环网络的最优路由算法

Evaluation method for terminal-pair reliability in undirected networks with unreliable Nodes

具有不完全可靠节点的无向网络终端对可靠性评价方法

An Approximation Algorithm for Finding the Longest Path in Undirected Connected Graph under Constrains

无向连通图中求约束条件下近似最长路算法

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

寻找无向图中全部生成树的复合支路和网络撕裂技术

Finding the Most Vital Edge of a Shortest Path in Undirected Networks

无向网络中最短路的最关键边问题

A Parallel Maximal Matching Algorithm for Undirected Graphs with Applications

无向图的边极大匹配并行算法及其应用

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.

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

常用短语

undirected graph

undirected graph - 无向图

adj.