| 释义 |
1 ?复杂性图形 ... 复杂性理论 komplexitaetstheorie complexity theory 复杂性图形 complexity graph 复杂性下界 lower bound on the complexity ...
- 1
Based on this extended directed graph, an algorithm for creating it is proposed, the time complexity analysis of the algorithm is given, and its correctness is proved. 基于这种扩充有向图，提出了一种对象范式生成算法，并给出了算法的时间复杂度分析和正确性证明。 - 2
With this method, the reliability to direct the constraint graph is increased, the computation complexity is reduced, and the cyclic constraint graph can be solved expediently. 应用此方法，可提高约束图有向化的可靠性、降低计算复杂度，且能方便地求解带有循环约束的约束图。 - 3
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. 本文以邻接矩阵作为图的存储结构，指出如何在计算机上实现克鲁斯·卡尔算法，并分析所设计算法的时间复杂度。
|