5-source-codes

floyd算法，用于图论中的最短路算法，使用matlab编写，简单实用(floyd algorithm for the shortest path in graph theory algorithms, using matlab to prepare, simple and practical)

LMS算法，自适应算法中的最小均方误差算法。(LMS algorithm, adaptive algorithm, the minimum mean square error algorithm.)

Matlab Learning in Persian

微电网多目标调度，运用改进的多目标粒子群算法进行计算，里面包含经济等三个目标函数设置((Smart Microgrid PSO, micro sources: photovoltaic, wind turbines, generators, energy storage, etc.))

卡尔曼滤波器c语言代码。需要的可以下载看看，不设权限，0积分下载。(Kalman filter c language)

modal analysis for two machine Kundor System

说明：  matlab实现成绩的查询！成绩用txt文件读入matlab中(matlab query)

求最短路径的kruskal程序源代码适用于最小生成树(The shortest path kruskal source code)

Ipad/Iphone 上传和下载文件的源代码，抛砖引玉，希望对大家能有所启迪！(Ipad/Iphone upload and download the source code file, the hope can be an inspiration to everyone!)

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )