资源列表
Entropyweight
- 利用信息熵原理，根据数据的混乱度，确定各个信息的权重系数-The use of information entropy theory, the chaotic degree of the data to determine the weight coefficients of the various information
rank
- rank of a matrix caloculation
TowerOfHanoi
- Tower of hanoi implementation in java
7
- 1．定义数据结构。 2．编写函数，实现插入排序算法。 3．编写函数，实现希尔排序或快速排序等效率较高的算法。-1. Define the data structure. 2. Write a function to achieve insertion sort algorithm. 3. Write a function to achieve Hill sort or quick sort, etc. more efficient algorithms.
yuesefu
- 用c语言开发的来实现约瑟夫环问题的求解程序。-C language development to achieve the Josephus problem solver.
cow_picnic
- 在有向图中从若干个点出发，寻找共同可达的点-find the point that some cows can have a picnic togeter in a digraph
uni_visco_exp
- C Explicit integration for isotropic and kinematic hardening C elasto-viscoplasticity C- C Explicit integration for isotropic and kinematic hardening C elasto-viscoplasticity C
The-matrix-the-chain-multiplication-
- 运用动态规划思想，解决矩阵链最优算法问题。-The use of dynamic programming to solve the problem of the optimal matrix chain algorithm.
DS_chap3_prj5
- 地图染色问题。地图上相邻的区域染成不同的颜色，地图用矩阵表示。-Map coloring problem. Map region adjacent dyed a different color, a matrix map.
coursework
- 共轭梯度法解决矩阵方程问题-Conjugate gradient method to solve the matrix equation problem
tower-issue
- 数据结构 动态规划算法 数塔问题的C语言代码-C language code number of dynamic programming algorithm data structure tower issue
paixu
- 第一行包括两个数字 N（村子数量 2 < N < 1,000）M(可以修的道路数量 1 < M < 20,000) 在下面的 M 行中，每行有 3 个数字 ABC，表示 AB 两个村庄之间的道路长度是 C。 条件：这条路尽可能的长并且把所有村庄连在一起，这条路不存在环-The first line contains two numbers N (village number 2 < N < 1,000) M (the number of ro