资源列表
weibuer
- 威布尔分布的参数估计，计算速度快，准确度高，值得深究-Parameter Weibull distribution estimates, calculation speed, high accuracy, worth studying
canshu
- 基础数据的计算，经检验可以运行，数据拟合程序-Calculated on the basis of data, the test can be run, data fitting procedure
bonus1
- 浙大数据结构bonus1：Binary Search Tree，检验不同上载数据是否为同一颗树-A binary search tree is uniquely determined by a given ordered insertions of a sequence of positive integers. On the other hand, a given binary search tree may correspond to several different insertion
code
- 浙大高级数据结构project 构建不同树的时间复杂度 包括斜堆左式堆-compute the time of construting different heaps
custom_csp_solving
- Constraint Satisfaction Problems in prolog
zhuangpeixian
- 算法导论的动态规划中的装配线调度算法的实现-Introduction to dynamic programming algorithm to achieve the assembly line scheduling algorithm
Genetic-algorithm-neural-network-
- 运用遗传算法优化神经网络结构，提高训练速度，运算精度-Genetic algorithm optimization of neural network structure, improve training speed, the precision
algorithm-about-resource-allocation
- 关于资源分配问题的改进算法，可以根据自己需要修改。-The improved algorithm about resource allocation problem, you can modify according to their own needs.
QuickSort
- C++编程中的快速排序Quick Sort算法的实现。-The realization of quick sort Quick Sort algorithm in C++ programming.
Floyd
- Floyd算法又称为插点法，是一种用于寻找给定的加权图中多源点之间最短路径的算法。-The Floyd algorithm is also known as the insertion point method, is used to search for a given weighted graph between different points in the shortest path algorithm.
TopolSort
- 拓扑排序算法的C++程序，根据输入的结点的入度和出度，对图中结点进行排序。-Topological sorting algorithm C++ procedures, according to the type of the node in degree and out degree of nodes in the graph, sort of.
HeapSort
- 堆排序，利用堆结构给指定数列排序。时间复杂度为nlog（n）。无辅助空间。算法效率稳定。-Heap sort, utilizing a stack structure to specify the number of columns to sort. The time complexity is nlog (n). No auxiliary space. Stable efficiency of the algorithm.