资源列表
dianligongying
- 实际生活中的电力供应问题，c语言编程实现-Real-life power supply, c language programming
mpqiuwenti
- 概率论中的经典问题--摸球问题的c语言实现方法-Classic problem in probability theory- the ball touch the issue of c language method
xinfengpipei
- 概率论中的经典问题信封匹配问题的c语言实现方法-Classic problem in probability theory matching envelope method of c-language
code
- 卡尔曼滤波，一个最优化递归处理算法，效果不错，能够运行。-Kalman filtering, a recursive processing algorithm optimization, good results, can run.
Matrix
- 矩阵类的Ｃ＋＋实现！可直接运行！Matrix.cpp Matrix.h-Matrix.cpp Matrix.h
TSPVCCODE
- 本算法主要是解决传统的旅行商问题最小成本下求解最小路径的问题，已经验证可以运行，没有错误，希望对大家有帮助-This algorithm is mainly to solve the traditional traveling salesman problem minimum cost path for solving the minimum problem has been demonstrated to run, no error, we want to help
TSPLINGOCODE
- 由于上面没有LINGO类型，所以以VC++代替，实际是LINGO程序，希望理解，主要解决TSP问题，程序已经调试通过，并添加了详细的注释-As above, there is no LINGO type, so as to VC++ instead of the actual procedure is LINGO, want to understand, the main problem to solve TSP, the program has been debugged, and added
daima
- 矩阵运算源代码用vb编写，为过程可以被直接调用。-Matrix operations source code for the process can be called directly.
floydalgorithmmatlabcode
- 弗洛里德算法，用于求解任意一个连通图中任意两个节点之间的最小路径，希望有帮助，已经调试通过-Floride algorithm for solving any of a connected graph any two nodes in the path between the minimum, want to help, have been debugging through
pi
- 用迭代法求PI(C++初级入门程序,比较菜)-an dian
searchroot
- 写程序求一元二次方程的解(C++入门程序,比较菜)-root