资源列表
rigid
- S-LD动力学方程数值分析，以上是m文件
Source1
- face recognition with opencv
sr
- 输入框提示
simplex_cpp
- linear programming by simplex meyhod in c-linear programming by simplex meyhod in c++
0518
- 这是一个实现数据结构中求解强连通子图的小程序，是实验课的产物，希望对学生朋友有帮助。-This is a data structure for solving strongly connected subgraph of small procedures, the product of the experimental class, the students want to help friends.
calander
- 计算日历。输入一个年份，即可输出每天是日期和对应的星期几-Calculation of the calendar. Enter a year, you can output the date and the corresponding day of the week
mokhpishrafte1
- digital communication
1
- 随机建立一个含N个整数的整数数组（输出），再按奇偶数分存于两个不同的线性表（顺序和链接）中并别输出上述两个表。-Random array of integers containing N integers (output), and then the parity number are stored in two different linear table (order and links) and do not output the two tables.
tu
- 数据结构,哈工大数据结构第三次实验,图求最小单元路径。-Data structure HIT data structure of the third experiment, Figure Find the smallest unit path .
C-Moyennes-Floue
- C-moyenne floue (La méthode C-moyenne floue (ou fuzzy C-mean) est une méthode de classification itérative qui permet de classifier les individus selon C classes )
untitled
- 参数为：载波频率f0为20MHz，采样频率为4倍f0，脉宽为1us ，脉冲周期为20us 。其中：-Parameters: carrier frequency f0 is 20MHz, the sampling frequency is 4 times f0, a pulse width of 1us, the pulse period is 20us. Of which:
T006_Floyd_Warshal
- T006_Floyd_Warshall算法任意两点间的最短路径-T006_Floyd_Warshall algorithm shortest path between any two