undirected

['ʌndi'rektid]

adj.无目标的,未受指导的,（信）无收件人姓名的

a.

1. 未受指导的

2. 无收件人姓名的

undirected

词义辨析：

同义参见:

headless

adrift

aimless

undirected[,ʌndi'rektid]adj.1.■没有指导的，没有指引的2.■(信件等)没写地址的，无通讯处的

1. lacking direction; without a particular aim, purpose, or target
   缺乏方向的；无目标的
   she was full of ineffectual undirected anger.
   她满腔无名怒火，不知向谁发泄。
   

undirected

形容词 undirected:

aimlessly drifting

同义词：adrift, afloat, aimless, directionless, planless, rudderless

undirected

■On the Dominating Number of 2-dimensional Undirected Toroidal Mesh

2维无向超环面网的控制数

■Markov network is an undirected graph, while Bayesian network is a directed acyclic graph.

Markov网是一个无向图 ,而 Bayesian网是一个有向无环图 .

■The MSS problem seeks to compute a set of vertex-disjoint simple paths in an undirected bipartite graph under certain constraints.

MSS 问题的目标，是在一个二分无向图上寻找由互不相交的路径所构成的集合，并要求这个集合满足一些特定的条件。

■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剖分的效率。

■Zhang Ziguo,Hu Aiqun,Chen Yong.Evaluation Method for Terminal-pair Reliability in Undirected Networks with Unreliable Nodes[J].Journal of Circuits and System,2005,10(5):136-138.

[3]钟子果,胡爱群,陈勇.具有不完全可靠节点的无向网络终端对可靠性评价方法[J].电路与系统学报,2005,10(5):136-138.

■"When a monk has emerged from the cessation of perception & feeling, three contacts make contact: contact with emptiness, contact with the signless, & contact with the undirected."

“居士!由想受灭起出之比丘，触有三种之触，即空触、无相触、无愿触是。”

■A Algorithm for Drawing Undirected Planar Graph

一个无向平面图的画图算法

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

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

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

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

■A New Algorithm for Finding all Undirected Hamilton ian Circuits in an Undigraph

一种求无向图中全部哈密顿回路的新算法

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

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

■A class of undirected graph G= abstracted from practical problems whose vertices and edges have varied weight,a clique of graph G is maximum complete subgraph in G.

一类由实际问题抽象出来的点边具有变权值的无向图G=,图G的团是G中的极大完全子图。

■undirected information

不定向信息

■undirected branch

不定向分枝

■undirected tree

不定向树 双向树 不定向树无向树

■any reaction that occurs automatically without conscious thought or reflection (especially the undirected behavior seen in psychomotor epilepsy).

不经过有意识的思考而自动做出的任何反应。

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

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

■In light of the definitions of the connection types, the weighted undirected liaison graph of the assembly is presented to identify the subassembly automatically and efficiently.

为了高效、自动地识别子装配体，根据零件联接类型，建立了装配体的带权无向连接图模型。

■Undirected, however, it can wreak havoc in your day-to-day experience.

人类所做的每一件事情都只是想改变他们的感觉，想改变“心境”。

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

从一实例分析出发，推导出一般线性目标规划数学模型的多重解结构为一无向图。

■From the viewpoint of advanced entities Monroe was in regular communication with, this first band reflected" a mass of discordant, undirected thought radiation".

从高度发达的实体的观点看，门罗与他们保持经常的联络，这第一环带反射出“大量不和谐、乱的思想辐射”。

■From the viewpoint of advanced entities Monroe was in regular communication with, this first band reflected "a mass of discordant, undirected thought radiation".

从高度发达的实体的观点看，门罗与他们保持经常的联络，这第一环带反射出“大量不和谐、杂乱的思想辐射”。

■From the viewpoint of advanced entities Monroe was in regular communication with, this first band reflected “a mass of discordant, undirected thought radiation”.

从高度发达的实体的观点看，门罗与他们保持经常的联络，这第一环带反射出”大量不和谐、杂乱的思想辐射”。

■SIMULATED ANNEALING ALGORITHM FOR K-VERTEX-CONNECTED AUGMENTATION ON THE ARBITRARY UNDIRECTED WEIGHTED GRAPH

任意无向加权图K点连通扩充的模拟退火算法

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

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

■Function of prg () used to calculate and output undirected graph of adjacency matrix.

函数prg( )用于计算并输出无向图的邻接矩阵。

■Firstly, the undirected graph model in product structure domain, the directed graph model in product function domain, and the vector table model in customer requirement domain were constructed.

分别构建了产品结构域无向图模型、功能域有向图模型和需求域向量表模型。

■Using this algorithm, arbitrary two vertexes in a given undirected graph can achieve a required vertex-connected degree.

利用该算法可最优地将给定无向图中任意2点达到所要求的点连通度。

■weighted undirected graph

加权无向图

■Counting Edge Cuts of Undirected Binary De Bruijn Graphs

图的边割计数

■In distributed applications, and computing applications, with plans to describe the data are no doubt very many of the undirected graph traversal breadth, depth, undirected graph traversal,

在分布式应用,和计算应用中,用图来描述数据无疑是非常多的广度遍历无向图,深度遍历无向图

■Researchers into nonlinear systems and cellular automata at the Santa Fe Institute and elsewhere have demonstrated that simple, undirected processes can yield extraordinarily complex patterns.

在美国圣塔菲研究所与其他研究机构，研究非线性系统与细胞自动机的科学家已经证明，简单又没有方向的过程可以产生极为复杂的模式。

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

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

■Research of Offset Press Inking System Based on Undirected Graph

基于无向图的胶印机输墨系统研究

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

基于跳数约束的无向图R边连通扩充

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

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

■Definition.An undirected graph is called chordal if every cycle of length greater than three posseses a chord, that is, an edge joining two nonconsecutivevertices of the cycle.

定义：无向图中，如果任意边数大于3的环，至少存在一条边连接环中不相邻的某两个点，则称此图为弦图.

■Kinesis - Random, undirected movement.

室壁运动 -随机，无向运动。Compare with Taxis.比较的士。

■The two algorithms for finding the minimal spanning tree of an undirected weighted graph are PRIM algorithm and KRUSKAL algorithm.

对求无向赋权图最小生成树两种算法分别是PRIM算法和KRUSKAL算法。

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

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

■You should thinkabout RDF as a labeled, undirected graph

应该把RDF视作为标签,非指引的图表

■The algorithm can get the new frequent itemsets through search the undirected itemsets graph once again,when the database and the minimum support are changed.

当事务数据库和最小支持度发生变化时,该算法只需重新遍历一次无向项集图即可得到新的频繁项集。

■Gender has undirected effect on the mental-disorders抯 happening through other variables.

性别通过其它变量对心理障碍的发生起间接作用。

■Criticism should have an aim; it shouldn't be undirected.

批评要有针对性，不要无的放矢。

■With the motivation of the undirected graph and bipartite partition, some new estimations for singular values of a matrix were presented.

摘要利用矩阵的无向图及二部分划，给出了新的复合型矩阵奇异值估计式，改进了已有的相应结果。

■Wireless sensor network could be described as an undirected graph.The convergence degree of the node was determined by the ratio of the number of sub-graph's vertexes and number of the edges.

摘要无线传感器网络可以用无向图表示，节点及其一跳邻节点构成一个子图。

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

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

■The paper presents the method of seeking spanning trees of undirected graphs by adopting calculating trees which is realized by enumerating the difference among spanning trees.

文章描述采用计算树的方法求解无向图的生成树,这种方法是通过列举生成树之间的差别来实现的。

■Kautz undirected graphs

无向Kautz图

■Undirected transitive signatures

无向传递签名