把dat文件转化为grd文件 供surfer使用

很好的教程实例，教务管理系统，Access数据库实现~-Very good tutorial examples of educational management system, Access database, to achieve ~

求乘积最大的子序列乘积,采用动态规划方法求解-product for the greatest sequences product using dynamic programming method for

哈夫曼编码译码的程序，详细大家能用的上。程序里面有注释-Huffman encoding decoding procedures, we can use the details on. There are procedures Notes

vfp database interface 数据库方面的interface设计文件-vfp database interface

校园导游的代码极其说明-tour of the campus code extremely Note

基于c++的各种算法，能是你在较短时间内掌握编程的精髓-Computing+for+Numerical+Methods+Using+Visual+C++

清华大学数据结构 严蔚敏 PPT+习题答案-Tsinghua University, Yan Wei-min data structure PPT+ Exercises Answer

labyrinth: you need to find the doable way to go to the destinaton.And then print out the path.-labyrinth: You need to find the doable way to go to the destinaton.And then print out the path.

前k条最短路径（KSP）算法在国内鲜有研究，本压缩包中文献整合了自1971年此问题被提出后几十年来的论文共25篇。 其中以Martin先生的删除（Delelte）算法与Yen先生的背离（Devation）算法为主。 其中所有文献均来自网络。含有两篇中文文章以及23篇英文文章。 算法的复杂度基本控制于O(logn)内-Pre-k shortest paths (KSP) algorithm in the domestic few studies in the literature in this compressed package integration since 1971, this issue has been moved for several decades a total of 25 papers. Among them, Mr. Martin removed (Delelte) algorithm and Mr. Yen departure (Devation) algorithm is based. In which all documents are from the network. Contains two Chinese articles and 23 articles in English. The complexity of basic control algorithms in O (logn) in

一个简单适用的产品订购系统，适合初学者使用-A simple application of the product ordering system, suitable for beginners to use