数值算法

用C语言实现的遗传算法的程序,实现的是y=x+10*sin(5*x)+5*cos(10*x)求最大值.实现环境为win-tc.-C language GA procedures, achieving is y = x 10* sin (x 5*) 5* cos (10* x) for the maximum. To achieve environmental w in-tc.

清华大学2002年出版的《科学与工程数值计算算法VB》配套源码，包括复数计算、矩阵运算、插值计算、线性非线性方程组求解、数值积分、数值拟和与逼近等算法和类，对于科学和工程数值计算很有参考价值！-Qinghua University, in 2002 published "Science and engineering numerical algorithm VB" complementary source, includes the plural, matrix computation, interpolation, linear solve nonlinear equations, numerical integration, and the proposed numerical approximation algorithms and other categories, science and engineering numerical computation of great reference value!

这是一个把文件转化成c/c++语言中的数组的代码， 方便把资源文件加入程序中编译。

USACO chapter two.Useful for beginners.

应用背景In generated networks, selecting one node as source and some nodes as receivers in random (single source multicast network), we make performance test for network coding based multicast route algorithm (we put forward it ourselves, corresponding to high multicast rate and low multicast rate), shortest path distribution tree route algorithm (DIJKSTRA algorithm) and Maximum-rate distribution tree route algorithm (PRIM algorithm), respectively. 关键技术 In this program, two things have been done: (1) generate random topologies (2)performance test。   network coding cap:     5.0000  dijk cap:     5.0000  prim cap:     5.0000  network coding res1:     0.0000--res2:    12.0000  dijk res:    14.0000  prim res:    14.0000  average degree:     2.

A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.

模拟植物生长算法的分形树源程序，根据迭代次数的不同获得一株完整的植物生长图，对其具体的参数进行修改可以做一些人工智能方面的优化

爬山法搜索的程序实现-mountaineering Act Search Program

用C++编写最小二乘曲线拟合函数程序-prepared least squares curve fitting procedures Function

     该程序代码对应《算法设计与分析基础---第2版》中最开始的求取最大公约数的三种算法，第一种欧几里得算法，第二种是连续整数检测方法，第三种方法是分解质因数的方法，代码简单易懂，适于参考学习。