undirected

undirected

美 [ˌʌndə'rektɪd]  英 ['ʌndɪ'rektɪd]

  • adj.未受指导的;不受指引的;(信等)未写姓名住址的
  • 网络无向;无主导;无指导的

反义词

同义词

英汉解释

adj.
1.
未受指导的;不受指引的
2.
(信等)未写姓名住址的,无通讯处的

英英解释

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

极大匹配并行算法及其应用

The Number of Spanning Trees in the Undirected Circulant Graphs with Non-fixed Jumps

固定步长循环支撑

At the start of Fearless, Huo is a ball of highly skilled but undirected martial-arts aggression;

电影开始只是一个武艺高强开化

The Characteristic Analysis of Undirected Double Loop Networks

特征分析

Reliability Analysis of Undirected Binary Kautz Networks

二元Kautz网络可靠性分析

Drawing Undirected Graphs with Genetic Algorithms

遗传算法

Estimations for Diameters of Undirected Double Loop Networks

网络直径估计

the super restricted edge connectivity of kautz undirected graphs

超级限制连通

The augmentation of undirected graph to a R-edge-connected graph based on hops-constraint

基于约束R连通扩充

On the Dominating Number of 2-dimensional Undirected Toroidal Mesh

2控制

all graphs considered in this paper are finite , undirected and simple

本文讨论有限简单