资源列表
DataStructuresandAlgorithmAnalysisinC
- 本书曾被评为20世纪顶尖的30部计算机着作之一,作者Mark Allen Wei-the book has been rated as the 20th century's top 30 for a one computer, the author Mark Allen Wei
getd
- 最优化设计程序之一.共轭剃度法.给出步长和初值.-optimal design procedures one. Conjugate tonsure law. And given initial step.
Graph_BFS
- 这个是图的广度周游的源代码。解压即可。算法比较简洁，复杂度较小。-the breadth of the plan is to travel around the source code. Decompression can be. Algorithm comparison simple, less complex.
cAlgorithm
- C++常用算法集合，里面有各种各样的算法，都用c++实现。-C common algorithms pool, which has a wide range of algorithms, using c achieve.
VCAlgorithm
- VC实现的常用数值计算方法，有许多算法，希望对大家有用-VC common numerical calculation method, there are many algorithms, we hope to useful
ProcessStudy
- 这是一个操作系统实验中模拟处理器进程处理的源程序,可供进行课程设计及学习的人参考!-This is an experiment simulated operating system processors process the source, available for curriculum design and learning of the reference!
zifuchuanpipeisuanfa
- 字符串近似匹配算法，具有实际应用意义-approximate string matching algorithm is practical significance!
multiplyofarrys
- 这是一个矩阵乘法 程序，按要求输入矩阵后可实现矩阵间的叉乘、点乘-This is a matrix multiplication multiplication procedure, as required input matrix matrix would be achieved by the fork, take points
kalman_C
- 离散随机线性系统的卡尔曼滤波。 其中13lman.c是卡尔曼滤波函数，4rinv.c是滤波函数中用到的矩阵求逆函数，13lman0.c是主程序。-discrete stochastic linear Kalman filtering system. 13lman.c which is the Kalman filter function, 4rinv.c filtering function is used in the matrix inversion function, is the m
sms_que
- 一个实现可以在进程间或者线程间通信的高效环形队列类，特别适用于那种生产者/消费者模型的应用中-an achievement in inter-process communication between threads or efficient circular queue category, particularly applicable to the kind of producer / consumer model of the application
10bullets90
- 十发子弹打中90环的解法，很多公司都采用这道题作为笔试题，在此提供了递归算法，大家可以共同研究一下-10 bullets hit the 90 Central solution, many companies have adopted Jesus as the T test, in a recursive algorithm, we can jointly study
quanguojiaotongzixun
- 用最短路径解决. 提供三种最优决策:最快到达,最少费用,最少中转站.-solution with the shortest path. For three optimal decision : fastest to reach at least cost, at least transfer stations.