金华门禁系统数据库脚本，包括门、EL键盘照明…

这是一个霍夫曼编码解码的源程序,可以用它高效实现霍夫曼解码编码,注释详细,可读性好.压缩包止包括源程序文件,再vc中运行.-Hoffman codec of the source, can be used to achieve efficient codec Hoffman Notes detailed and readable. Compressed only those source files, then vc run.

一个封装好的优先队列,用C++实现的,已经经过调试,直接用就行-A good package priority queue, using C++ Realize, and have been debugging directly on the line

各种数据整合,使用与各种数据库的整合，，各种数据整合-A variety of data integration, use and integration of various databases, a variety of data integration

一种更简单，效率更高的最小生成树的基于VC的环境的算法！-A more simple, more efficient VC-based minimum spanning tree algorithm for the environment!

包含冒泡排序算法函数模板和数据结构中的字符串查找例子及解线性方程组的3个典型算法加演示。-Contains the Bubble Sort algorithm function templates and data structure of string to find examples and solutions of linear equations of the three typical algorithms plus demo.

VC读写excel

0-1背包和 背包问题的动态规划 源程序 只是测试 不过要自己输入 还要自己加入 很简单就没有更改-0-1 knapsack problem knapsack and the dynamic programming source code is to test but also to input their own entry is very there is no simple changes

Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part. -Computes estimates for the number of fores ts of a graph. input as a 0-1 incidence matrix. Notes : Compile in C, "g-o span_forest span_forest.c." The program does not demand that the matrix is symmetric wit h 0 diagonal. but uses only the upper triangular part.

用VB与ACCESS数据库结合编写的远程数据传输程序-Using VB with ACCESS databases prepared by remote data transmission procedure

一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。对于给定的n和k个加油站位置，编程计算最少加油次数。并证明算法能产生一个最优解-Fill up the car after driving an n km. There are a number of gas stations journey. Design an efficient algorithm that at which stations should stop to refuel along the way so that the least number of refueling. For a given n and k-station location, the calculation program for at least the number of refueling. And to prove that the algorithm can produce an optimal solution