查询词典 disjoint

By using disjoint sets to handle those P tips, rest of the work can be left to the Bellman-Ford algorithm.

只要用并查集来处理那些 P 提示，剩下的工作可以交给 Bellman-Ford 算法。

Firstly, the conception of network system reliability and method of calculation reliability for network system are introduced in the thesis. Secondly, calculation method analysis and detailed realization of searching node method and method of calculation of disjoint form minimal path sets are the emphases of this paper.

本文首先介绍了网络系统的概念和网络系统可靠性分析的相关概念及方法，然后着重于本文要采用的节点遍历法和最小路集不交化方法做了算法分析和具体实现，最后将计算程序简单界面化并加以实际应用。

Hierarchical clustering of multivariate data or distance data; disjoint clustering of large data sets; nonparametric clustering with hypothesis tests for the number of clusters.

聚类多元数据或距离数据；大型数据集不相交的聚类；与集群的若干非参数假设检验集群。

The performance function was decomposed into disjoint sets of variables to address the combinatorial explosion challenge caused by configuration variations.

该方法通过將性能函数分解为互不相交的变量子集，解决了因配置多样性產生的组合问题。

It is found that loop-carried flow dependencies form a set of disjoint linear ordered sets, and that there is one and only one basis that is independent and inclusive, making unnecessary all the other dependencies.

利用这一性质，围绕着包含这一概念，该文为VLIW结构上的流相关分析提出了一个完整的娄学模型，发现体间流相关集合可划分为若干不相交的线序集合，存在且仅存在一个独立的、全包含的流相关集合，使其他所有流相关都不必要。

Use disjoint sets to maintain the groups and use either a segment tree or a binary search tree to find the k -th largest group.

用并查集维护所有的组，然后用线段树或二叉搜索树查找第 k 大的组。

If the vertex set of a graph can be partitioned into two disjoint nonempty sets V_(1) and V_(2), every vertex in V_(1) connects every vertex in V_(2) and there is no edge in V_(1) and V_(2), then we call this graph is a complete bipartite graph. If V_(1) contains m elements and V_(2) contains n elements, then we denote this complete bipartite graph K_.

当一个图中的点集合可以分成两个非空的集合V_(1)及V_(2)，若 V_(1)中的每一点都与V_(2)中的点有边相连，且在V_(1)及V_(2)中的点都没有边相连，则称此图为完全二分图；若 V_(1)中有m个点，V_(2)中有n个点，则此完全二分图记为K_。

We propose an efficient method toextend the network lifetime by splitting the sensor nodes into a maximal number of disjoint sets which are activated successively.

我们提出一种有效的方式来延长网络寿命，这种方式将传感器节点以最大程度分成不相交的集合，每个集合中的传感器节点轮流启动监视目标节点。

In statistical inferences,somtimes we deal with such problems:the numberof obersavations falling in some disjoint sets is known,but no individual valuesof the observations are recorded.we call such observations the grouped sam-ples.

在统计推断中，我们有时会得到这样的数据：数据的具体值未知，但是知道数据落入一些不相交区域中的个数，我们称这样的数据为分组数据。

If d +d ≥n for every two strongly disjoint independent sets S and T with|S|=s and|T|=1, respectively, then G is hamiltonian.

设s，t是两个正整数，G是一个2-连通n阶图，若对任意两个强不交独立集S和T，其中|S|=s，|T|=t，有d+d≥n，则G是哈密尔顿图。

In the United States, chronic alcoholism and hepatitis C are the most common ones.

在美国，慢性酒精中毒，肝炎是最常见的。

If you have any questions, you can contact me anytime.

如果有任何问题，你可以随时联系我。