Hungarian algorithm, using C realize. Can be used, I tried, carried out another.

讲述如何利用VC的编程来求解微分方程的一种思想-VC on how to use the programming to solve a differential equation thinking

内含文件：音频文件WAV特技播放的原理及实现,PDF格式-containing documents : WAV audio files stunt shows, the theory and implementation, PDF format

vb程序设计常用算法 算法分析用vb实现-vb programming algorithm analysis algorithm used to achieve vb

用数据结构(C语言版)编写程序，实现一个国际象棋的马踏遍棋盘的演示程序。具体要求为：将马随机放在国际象棋的8*8棋盘的某个方格中，马按走棋规则进行移动。要求每个方格只进入一次，走遍棋盘上全部64个方格。用堆栈编制非递归程序求出马的行走路线，并按求出的行走路线，将数字1,2,3,……,64依次填入一个8*8的方阵，输出之。 -With the data structure (C language version) to write programs to achieve a chess board horse travels to the demonstration program. Specific requirements are: the horses were randomly placed in the 8* 8 chess board in a box, Ma according to the rules of chess to go mobile. Requires that each box is only entered once, traveled all the 64 squares on a chessboard. The preparation of non-recursive procedure with the stack order to run for walking routes, and then find the routes will be the number 1,2,3, ... ..., 64 in turn fill in an 8* 8 matrix, the output of.

结合FAT,对u盘文件系统进行了较详细的分析，看了后相信你会有不少的收获。-Combination of FAT, disk file system for u to carry out a more detailed analysis, I believe you will be after reading a lot of harvest.

这是一款实用的屏幕抓图程序，大家可以下来看看，-This is one practical procedures From Wikipedia screen, we can see down, Ha-ha

C-W节约算法是最经典的求解车辆路径问题的启发式算法。-The Clarke and Wright(1964) savings algorithm is perhaps the most widely known heuristic for the VRP.

西庇阿立即下令停止追击，罗马军重新列阵。在两场血战之后罗马军总数只剩两万人前后。他们的面前则是以逸待劳的汉尼拔精锐两万四千人，此时汉尼拔阵的正面首次宽于罗马军，罗马军处于数量、体力和阵法的三重不利地位。然而在双方开始进军之时西庇阿下令罗马军的后两个战列脱离阵形，快速向两侧移动，使得罗马军从三列标准阵变成一字长蛇阵，正面宽度反压倒汉尼拔，力图凭借阵形优势两翼包抄、决一死战……”

pid参数的调节方法，对pid参数的选定有很大帮助，是前人的总结不可不看。-pid adjusting the parameters of the method, the pid of the selected parameters will be of great help, is summed up by our predecessors can not see.

如何用DELPHI实现屏幕拷贝 这里面说的很清楚 有意者可下载-how DELPHI screen copy that everything that was said very clearly Interested parties may download