无向图用英语怎么说,无向图的英文翻译


词语导航

基本信息

词语:无向图

繁体:無向圖

拼音:wú xiàng tú

英语翻译

【计】 undirected graph

相关词条

1.non-directedgraph  2.nonorientedgraph  3.undirectedgraph  

分词翻译

无的英语翻译:

naught; nonexistence; not; nothing; without; lack; zero
【医】 a-; leipo-; lipo-; non-

向的英语翻译:

always; at; be partial to; direction; face; out; to; toward
【医】 ad-; ak-; ob-

图的英语翻译:

chart; drawing; fig.; map; plot; picture; intention; attempt; plan
【计】 diagram; graphtyper
【化】 diagram
【医】 chart; column diagram; diagram; graph; map; picture; schema; scheme
sheet

翻译例句

1. 无向图dot语言语法生成。

Undirected graph dot language-syntax generation.

2. 实现连通无向图的深度和广度优先遍历。

Connectivity to the map without the depth and breadth - first traversal.

3. 然后提出了一种基于加权无向图的控制方法。

And then the control method based on weighted graph was presented.

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

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

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

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

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

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

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

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

8. 给定一个无向图,编写函数找出所有的最小高度树,并返回其根标号的列表。

Given such a graph, write a function to find all the MHTs and return a list of their root labels.

9. 条件随机场是一种无向图模型,它具有产生式模型和最大熵马尔可夫模型的优点。

Conditional Random Fields (CRF) is arbitrary undirected graphical model that bring together the best of generative models and Maximum Entropy Markov models (MEMM).

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

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.

11. 将表示电路的超图转化成带权值的无向图,从而将电路二等分问题转化成图的划分问题。

The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graph partition problem.

12. 该算法利用二进制数分割无向图的顶点集,通过对子图各顶点的关联集的运算产生相应的割集。www.wentIyi.cOM

The algorithm use a binary digit to divide the vertex set of a non-direction graph, and employ the incident sets of the vertices in the subgraph to produce opposite cut sets.

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

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.

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

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.

15. 网络中的每个成员都是一个连续时间的动力学系统,而它们之间通讯网络是用一个无向图来刻画的。

Each agent in the network is described by a continuous-time dynamics and the communication network is described by a undirect graph.

16. Graphviz及其处理定向和无向图的过滤器,以及Perl强大的文本处理能力是实现可视化的最佳组合。

Graphviz, and its associated directed and undirected filters along with the text-processing power of Perl are a great combination for visualization creation.

17. 研究和实现了图论中无向图的简单路径查找算法,对连锁表的编制规则进行了总结,实现了相应的联锁表自动生成算法。

Based on the research of the rules to compose the interlocking table and simple path search of graph, we design an algorithm to generate the interlocking table from signal arrangement.

18. 本文提出的方法在目的端利用获得的中间节点位置信息来生成无向图,再利用广度优先遍历算法BFS计算出另外一条不相交路径。

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.

19. Oozie工作流是放置在控制依赖DAG(有向无环图Direct Acyclic Graph)中的一组动作(例如,Hadoop的Map/Reduce作业、Pig作业等),其中指定了动作执行的顺序。

Oozie workflow is a collection of actions (i.e. Hadoop Map/Reduce jobs, Pig jobs) arranged in a control dependency DAG (Direct Acyclic Graph), specifying a sequence of actions execution.

20. 算法来找到一个层次树在一个有向无环图吗?

Algorithm to find a hierarchy tree in a directed acyclic graph?

21. 这是存储唯一的路径通过一个有向无环图的现实?

Is it practical to store unique paths through a directed acyclic graph?

22. 拓扑排序必须在无环的有向图中进行。这样的图叫做有向无环图,缩写为DAG。

A topological sort is carried out on a directed graph with no cycles. Such a graph is called a directed, acyclic graph, often abbreviated DAG.

23. 其次,分析了适用于网格环境的高性能计算应用的程序结构,并通过有向无循环图(DAG)加以表示。

Secondly, the program structure of high performance computing applications in the grid environment is analyzed and represented by the directed acyclic graph (DAG).

24. 的n阶有向无环图的拓扑排序的可能的最大数量是多少?

What is the maximum number of possible topological sorts of N-order Direct Acyclic Graph?

25. 有向无环图支持向量(DAG-SVMS)多类分类方法,是一种新的多类分类方法。

Directed acyclic graph support vector (DAG - SVMS) multi - category classification methods, is a new multi - category classification methods.

26. 有向无环图支持向量(DAG-SVMS)多类分类方法,是一种新的多类分类方法。

Directed acyclic graph support vector (DAG - SVMS) multi - category classification methods, is a new multi - category classification methods.

版权声明:问题易所有作品(图文、音视频)均来源网络,版权归原创作者所有,与本站立场无关,如不慎侵犯了你的权益,请联系我们告知,我们将做删除处理!