pb 源码 日历控件

一个简单的access数据库实例，使用了CGridCtrl控件。-A simple access database instance, use the CGridCtrl control.

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.

pao madengsd sdf sdfdfs dfsdf -pao madeng fghdfhgfdgfgfggffg

最短路径的具体实现，使用了dikstra算法-Concrete realization of the shortest path, using the algorithm dikstra

vb源代码完全数据库控制-vb source database completely control

模拟银行家算法，有效避免死锁．附带详细的实验报告！-Simulation bankers algorithm avoid deadlock. The report detailed experimental fringe!

C++数据库课堂实例 三次代码，层层递加-C++ class instance of the database code three times, layer upon layer additive

在学习数据结构时，往往不知道那些结构与算法有何用，以及怎么用。这个小小程序充分显示了Huffman二叉树的应用。虽然其压缩效果比RAR相差甚远，但也能说明一二。 -the study data structure, they often do not know what the structure and algorithm, as well as how use. This little procedure fully demonstrated the application of the binary tree Huffman. Although the compression ratio falls far short of RAR, but can also explain on January 2.

数据结构典型算法实现，c实现二叉树的遍历以及赫夫曼编码-data structure typical algorithm, c achieve the traversal of a binary tree Huffman coding

vb数据库操作演示-vb database operation and demonstration