不相交用英语怎么说,不相交的英文翻译


词语导航

基本信息

词语:不相交

繁体:不相交

拼音:bù xiāng jiāo

英语翻译

【计】 disjoint set

相关词条

1.noncrossing  

分词翻译

不的英语翻译:

nay; no; non-; nope; not; without
【医】 a-; non-; un-

相交的英语翻译:

cut; intersect; make friends with
【机】 intersect

翻译例句

1. 双曲线逐渐接近它的渐近线但不相交。

A hyperbola approaches but does not meet its asymptote.

2. 根据定义,平行线是永不相交的直线。

Parallel lines are, by definition, lines that never join.

3. 平行线是永不相交的线。wwW.WEnTIYi.COm

Parallel lines are lines that never join.

4. 无限伸展,却永不相交。

Though infinite, can never meet.

5. 按照定义,平行线是在同一平面上永不相交的线。

Parallel lines are, by definition, lines on the same plane that never join.

6. 拖动蓝点,让所有线都不相交,看看你多久能解开?

Position the blue dots such that no lines overlap. How quickly can you solve it?

7. 这些培训消息集比较大,而且有一部分是与测试集不相交的。

The training sets are both larger and partially disjoint from the testing collections.

8. 然后给出了边不相交路选择算法的设计思想和算法的过程。

Second, this paper gives the design idea and the algorithm procedure of the DPSP.

9. 重写阶段将使用该信息来确定UNIONALL分支不相交。

The rewrite phase will use this information to determine that the UNION ALL branches are disjoint.

10. 给定一组随机点的随机链接,如何定位使他们链接线不相交?

Given a set of random points that are randomly linked, how to position them so that their link lines do not intersect?

11. 请注意,第二个区域中与第一个区域不相交的区域颜色是蓝色。

Notice that the area of the second region that does not intersect with the first region is colored blue.

12. 加泰隆数又是用不相交的对角线划分几边形成三角形的方式数。

The Catalan numbers also count the number of ways in which ann-gon can be dissected into triangles by nonintersecting diagonals.

13. 如果她是你的行为无动于衷,这种狭隘的不相交值得一提的朋友。

If she is indifferent to your actions, that such a narrow-minded friend of disjoint worth mentioning.

14. 煤矿生产或采矿设计中经常会遇到求解空间不相交巷道间的距离问题。

During the production or design in coal mine, the solve of the distance problem about the space disjoint tunnel are often met.

15. 在没有精确的网络拓扑结构情况下,找出多条不相交路径是比较困难的。

The problem in multipath routing is that it is much more difficult to find multiple node-disjoint paths because of the lack of an accurate network topology.

16. 给定一个无向连通图g,圈包装问题就是求g的边不相交圈的最大数目。

In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edge disjoint cycles in g.

17. 分析实验结果发现,不相交路径权值累积算法能有效计算网络成员关联度。

Disjoint paths weight accumulating algorithm is proved to be effective in correlation computing by analyzing the results of the experiments.

18. 四通孔布线算法用于实际MCM布线时,需要解决最大加权不相交匹配问题。

For the Four Via routing algorithm used in MCM routing, the maximum weighted non crossing match problem should be solved.

19. 如果一个偏序集可以分解成不相交的对称链之并,则称此偏序集具有对称链分解。

A poset is called a symmetric chain decomposition if the poset can be expressed as a disjoint union of symmetric chains.

20. 语义缓存由互不相交的语义区域组成,每一个语义区域包括语义描述及其数据指针。

The semantic cache consists of disjoint semantic regions, and each semantic region includes a description and a corresponding data pointer.

21. 并且,我们利用可靠性理论对相交和不相交两种情况下的路由可靠性进行了理论分析。

Furthermore, we utilize the reliability theory to analyze the route reliabilities of disjoint and non-disjoint multipath routings.

22. 通过将集列分成有限个互不相交的子集列,给出了求集列的上限集和下限集的新方法。

Through set sequence is resolved into finite mutually disjunct subsets, the new method to solve the limit superior and limit inferior of set sequence is give.

23. 该算法利用网格中节点的地理信息进行路由,并且选择一条最稳定的不相交备用路由。

EASBRA utilizes the node"s geographical information to route and selects the most stable disjoint backup route.

24. 介绍了一种优化方法——围法,该方法的基本原理是利用函数等值线封闭且互不相交。

In this paper, a new optimization method named surround method is introduced. and Its bases upon isoclines of function are closed and doesn"t intersect with each other.

25. 我宁愿我们是永不相交的平行线。因为在那仅有的一次交点后,我们会离彼此越来越远。

I would rather we were parallel lines, which will never intersect, because after the point of the only intersection, we are going to be further apart.

26. 如果合并次数非常多,与数据流的规模相比不相交区间的数目很少,应当做怎样的优化?

What if there are lots of merges and the number of disjoint intervals are small compared to the data stream"s size?

27. 说明:输入两个矩形,判断两个矩形是否相交,如果相交,计算出相交的面积,不相交返回。

Input the two rectangular determine whether two rectangles intersect if intersect, calculate the area of ​ ​ the intersection of disjoint return.

28. 说明:输入两个矩形,判断两个矩形是否相交,如果相交,计算出相交的面积,不相交返回。

Input the two rectangular determine whether two rectangles intersect if intersect, calculate the area of ​ ​ the intersection of disjoint return.

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