资源列表
Newton-lagrange
- 牛顿-拉格朗日插值法C++源代码，最新修改的通码，网友可以-Newton-Lagrange interpolation C source code, the latest revision of immigration code, net surfers can s
dijkstra
- dijkstra最短路径算法，可以在最短路由算法求解或者状态距离路由算法中需要用到
BPyy
- 利用BP算法实现异或功能
ComputerProgramCodeForTheStandardAtMospheric
- Computer program code for the standard atmospheric
1
- 严蔚敏数据结构习题集答案 第一章 学习数据结构-Yan Wei-min data structure chapter problem sets answers
therealizationofsequencelist
- 用模板类的继承，实现顺序表的几个函数功能，主要包括线性表的插入，追加和删除-the realization of sequence list
juzhengzhuanzhi
- 数据结构，用C++实现矩阵转置，详细代码及注释-Data structure in C++ implementation matrix transpose, detailed code and comments ... ...
c
- 正交多项式法计算最小二乘法拟合的c语言程序-Orthogonal polynomial method to calculate the least-squares fitting of c language program
Huffman
- 哈弗曼树 设字符集为26个英文字母，求出每个字母的出现频率-huffman tree Set the character set of 26 letters of the alphabet, find the frequency of occurrence of each letter
geo2mag.pro
- IDL coordinate conversion program__from GEO coordinate to MAG coordinate
3_hanoi
- 汉诺塔是根据一个传说形成的一个问题： 有三根杆子A，B，C。A杆上有N个(N>1)穿孔圆盘，盘的尺寸由下到上依次变小。要求按下列规则将所有圆盘移至C杆： 每次只能移动一个圆盘； 大盘不能叠在小盘上面。-Tower of Hanoi is formed according to a legend a problem: There are three poles A, B, C. A rod with N (N> 1) perforated disc, the disc
Bellman_ford
- T0041_最短路径Bellman_ford算法优化,bellman-ford优化-T0041_ Bellman_ford shortest path algorithm optimization, bellman-ford optimization