kruskal
英
美
网络 克鲁斯卡尔算法; 克鲁斯克尔; 克鲁思卡尔; 克鲁斯卡尔; 最小生成树
双语例句
- Kruskal Wallis one way analysis of variance
克瓦二氏单因子变异数分析 - My grandparents were born in Veracruz, shafranov kruskal criterion
我的祖父母出生在韦拉克鲁斯，沙弗拉诺夫克鲁斯卡尔判据 - Investigation of a shortest path algorithm based on Kruskal algorithm
基于Kruskal算法的最短路径算法研究 - The Realization and Analysis of Kruskal's Algorithm Based on Greedy Policy
基于贪婪策略的克鲁斯卡尔算法的实现与分析 - The two algorithms for finding the minimal spanning tree of an undirected weighted graph are PRIM algorithm and KRUSKAL algorithm.
对求无向赋权图最小生成树两种算法分别是PRIM算法和KRUSKAL算法。 - The knowledge of cardio cerebrovascular disease, sex and high fat diet were highly significant in Kruskal Wallis and Bayes discriminant analysis.
心脑血管疾病知识、性别、高脂饮食在秩和检验、Bayes判别分析中有显著意义，高盐饮食在Bayes判别分析、逐步回归分析中有显著意义。 - Second order infinitesimal neighborhood outside the horizon of Kruskal space time is Minkowski space time
Kruskal时空视界外二级无穷小邻域是Minkowski时空 - Marriages in Kruskal Wallis, Bayes discriminate analysis, stepwise regression analysis were significant ( P ≤ 0.011 4).
婚姻在秩和检验、Bayes判别分析、逐步回归分析中有显著性（P≤0.0114）。 - METHODS: Kruskal Wallis, Bayes discriminate analysis, stepwise regression analysis, logistic regression analysis were adopted and the physical examination data of 3 148 intellectuals of the title technical and professional in Baotou Steel Iron Factory in 2001 were used for screening 18 factors related to hypertension.
方法：采用秩和检验、Bayes判别分析、逐步回归分析与Logistic回归分析4种方法，利用2001年包钢3148名知识分子的调查体检资料，对可能与高血压发生相关的18项因素进行筛检。 - This text regards adjacent matrix as the memory structure of graph, and points out how to realize Kruskal algorithm in the computer, and analyses its complexity.
本文以邻接矩阵作为图的存储结构，指出如何在计算机上实现克鲁斯卡尔算法，并分析所设计算法的时间复杂度。 - A topology optimization model with the objective of minimizing the total length of pipe has been established, and been solved by the kruskal algorithm.
建立了以管网总长度最小为目标的管线拓扑优化模型，采用图论中求连通图最小生成树的Kruskal算法求解。 - First, we apply Kruskal algorithm to find the median genome; second, we construct the breakpoint graph; finally, we compute the distance between the median genome and every genome.
利用最小生成树方法找到一个中心基因组，接下来构造断点图，最后利用断点图来计算集合中的每一个基因组和中心基因组之间的距离。 - Comparison of measurement data using independent samples t-test, compared with the count data using Pearson Chi-square test, grading information using Wilcoxon W test or Kruskal Wallis test.
计量资料比较采用独立样本t检验，计数资料比较采用Pearson卡方检验，等级资料采用WilcoxonW检验或KruskalWallis检验等统计方法。 - The comparison of two groups of measuring data with the use of two independent samples nonparametric test ( the Mann-Whitney test); Multiple sets of measurement data comparing with multiple independent samples nonparametric test ( Kruskal Wallis test).
两组计量数据的比较用使用两个独立样本的非参数检验（Mann-Whitney检验）；多组计量数据的比较用多个独立样本的非参数检验（Kruskal-Wallis检验）。 - Then using Kruskal algorithm, a maximum weight spanning tree is constructed from complete datasets, and based on initial order of node, the orientation of edges is adjusted.
基于初始化后的完整数据，应用克鲁斯卡尔算法建立最大权重生成树，并按照上述的节点次序确定生成树中边的方向。