Mainly for the VC database programming use, a detailed description of the ODBC a...

Mysql for Windows最新源码，vc6vs.net均可编译，吐血上传。-Mysql latest source code for Windows, vc6 vs.net can compile and upload to vomit blood.

森林状的关系图，用java实现的森林状的关系图-forest from the map, using java for the forest-like diagram

C++经典大整数实现,加减乘除.输入输出-C classic large integer, the arithmetic. Input and Output

数据结构中栈的经典算法――第一类背包问题，已经通过测试！-The stack data structure in the classic method- The first knapsack problem, has passed the test!

一个可以应用的案例，但是数据库操作不复杂。其中全面地涵盖了所有常用数据库操作。-1 can be applied to the case, but the database operations are not complicated. Which comprehensively covers all common database operations.

最小生成树问题 若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。 （1）利用克鲁斯卡尔算法求网的最小生成树。 （2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 （3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.

解决N皇后问题的源码及可运行程序，分析各种情况，并输出，直观，有效！-Solve the N Queens problem can be the source and run the program, analyze, and output, intuitive, and effective!

本程序用Labview可将需要的数据写入到数据库中，方便可行，适合初学labview和数据库的人使用。

hash排序，用hash法进行字符或数字的排序。-hash

数据库设计指南-60个设计技巧值得参考-Database Design Guide-60-design skills worthy of reference