搜索资源列表
RecursiveAlgorithmForTransformationOfQuot
- 递归算法改造"求最大公因数"的欧几 里 得 算 法,华大出品-Recursive algorithm for transformation of " seeking the greatest common factor" of the Euclidean algorithm, UW produced
Kruskal
- 编程实现Kruskal算法，生成最小代价生成树，其中利用最小堆算法实现。 （随机生成n个点，且随机生成k条边，形成连通图） 根据输入的顶点数的不同，分析时间复杂度。-Implement Kruskal’s algorithm based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree. Generate weighted undirected com
Prim
- 编程实现Prim算法，基于最小堆数据结构，生成最小代价生成树。 （其中随机生成点和边，形成连通图） 根据输入的顶点数的不同，分析时间复杂度。-Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree. Generate weighted undirected complete graph for
liangxi
- 求两个整数的最小公倍数的简单的算法代码，辗转相除法-Least common multiple of two integers a simple algorithm code, the Euclidean algorithm
val
- 欧几里得定理求最大公约数，并且利用最大公约数求最小公倍数的算法实现。-Euclidean theorem of seeking the common denominator, and seek the greatest common divisor lcm algorithm
JuggleRotate
- 辗转相除法的代码实现。辗转相除法， 又名欧几里德算法（Euclidean algorithm）乃求两个正整数之最大公因子的算法。它是已知最古老的算法， 其可追溯至3000年前-Euclidean algorithm, also known as Euclidean algorithm (Euclidean algorithm) is seeking the greatest common factor of two positive integers algorithm. It is the o