拓扑排序用英语怎么说,拓扑排序的英文翻译


词语导航

基本信息

词语:拓扑排序

繁体:拓撲排序

拼音:tuò pū pái xùWWw.WENTiyi.COm

英语翻译

【计】 topological ordering; topological sort; topological sorting

分词翻译

拓的英语翻译:

develop; open up; rubbings

扑的英语翻译:

attack; flap; pounce on; rush at; snap; throw oneself on

排序的英语翻译:

sort; taxis
【计】 sequencing; sort; sorting; sorting order
【化】 precedence ordering

翻译例句

1. 这通过图表中的拓扑排序算法实现。

This is done by using a topological sort algorithm on the graph.

2. 拓扑排序是有向图的一种重要运算。

The topological sort is an important operation of directed graphs.

3. 拓扑排序是可以用图模拟的另一种操作。

Topological sorting is another operation that can be modeled with graphs.

4. 关键路径通常是在拓扑排序的基础上求得的。

Critical paths are usually obtained by topological collating.

5. 拓扑排序算法既可以用于连通图,也可以用于非连通图。

The topological sorting algorithm works on unconnected graphs as well as connected graphs.

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

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

7. 这是一个拓扑排序的例子,对学数据结构的同学有很大帮助!

This is a topological sorting example, the data structure of the students will have a great help!

8. 提出一种有向权图的拓扑排序算法,并给出一实例说明其应用。

This Paper provides an algorithm of topological sequencing for weighted directed graph, and illustrates its application with an example.

9. 通过定义节点编码图概念,提出一种不需要拓扑排序的求解关键路径的新算法。

A new algorithm for finding the critical paths is proposed by using coding graph and without topological sort.

10. 拓扑排序必须在无环的有向图中进行。这样的图叫做有向无环图,缩写为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.

11. 如果需要某种更深奥的排序方法,您可能要查看tsort命令,该命令对文件执行拓扑排序。

If you need a more esoteric kind of sort routine, you might want to check out the tsort command, which performs a topological sort on a file.

12. 对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。

This paper discusses the application of adjacency matrix at the algorithm"s analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.

13. 基于组件的密码学虚拟实验室(VLCC)采用有向无环图(DAG)的拓扑排序机制管理组件。

Virtual Laboratory of Cryptology based on Components(VLCC) uses topological sorting in Directed Acyclic Graph(DAG) to manage the data-dependant and execute-order between components.

14. 引入浮动工时率的概念,提出了结合浮动工时率和网络计划工序拓扑排序的一种新的编码解码方法。

The concept of float rate was introduced. Integrating float rate with the toposorting of activities in network scheduling, a new method of coding and decoding was presented.

15. 在算法设计与实现中采用一个链接结构的“优先序列”,用它保证有向无回路图顶点的分层拓扑排序。

A "priority queue" which has a linked structure is used in this algorithm, which insures to complete LTP with the vertices in directed acyclic graph.

16. PTSA算法为工程中各子工程的串行或并行安排提供了确定的选择,提升了拓扑排序算法的实用价值。

PTSA provides many possible choices for all sub-projects in a project which will be arranged in serial or parallel way, so PTSA improves the applied value of Topological Sort Algorithm.

17. 摘要拓扑排序是有向图的一种重要运算。用一种线性的算法得到有向无圈图的一个更趋于合理的拓扑序列。

The topological sort is an important operation of directed graphs. Th is paper presents a linear algorithm to obtain a more reasonable topological sorting in...

18. 拓扑排序和标准sort之间的差别如清单2所示(您可以从参考资料下载happybirthday . txt)。

The difference between a topological and standard sort is shown in Listing 2 (you can download happybirthday.txt from Resources).

19. 结果表明,Hilbert曲线的确能够更好地根据拓扑聚集数据,与Z 排序相比,它可以减少 1.5% 的数据物理读。

The result shows that indeed the Hilbert curve clusters the data better according to their topology, giving us an additional 1.5% less data physical reads, compared to the Z-ordering.

20. 本文综述了关于某些拓扑不变量,六角链的极值和排序问题的一些研究进展及进一步思考。

In this paper, some results and further considerations on the extremes and orderings of hexagonal chains with respect to some topological invariants are introduced.

21. 本文综述了关于某些拓扑不变量,六角链的极值和排序问题的一些研究进展及进一步思考。

In this paper, some results and further considerations on the extremes and orderings of hexagonal chains with respect to some topological invariants are introduced.

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