常用结构源码 希望大家好好看看 很有帮助

数据结构 之树的生成与操作 算法-tree data structure formation and operation of the algorithm

投票问卷管理系统 V1.2.rar-vote questionnaire management system V1.2.rar

文章详细讲解分支限界的基本思想，单元最短路径问题，装载问题，0-1背包问题，旅游售货员问题等。-Detailed article on the basic idea of branch and bound, the shortest path problem unit, loading issues ,0-one knapsack problem, travel salesman problem.

酒店管理程序，主要用于小型饭店点菜收银，功能完备-Hotel management program, mainly for small a la carte restaurant cash register, a fully functioning

一个用vb编的数据库的基本操作。-vb series with a database of the basic operation.

算法设计与分析中的贪心法源程序，用VC编写，应用贪心设计策略来解决操作系统中单机、无资源约束且每个作业可在等量时间内完成的作业调度问题-algorithm design and analysis of the greedy algorithm source, VC preparation, application greedy design strategies to solve the stand-alone operating system, without resource constraints which each job can be in the same amount of time to complete the job-scheduling problem

完成在ODBC中进行异步调用的C程序源代码，运行环境Windows.-Completed in the ODBC asynchronous calls in C source code, runtime environment Windows.

是我应我们学校学工部做的软件,其主要是解决想我们学校这样的条件--各个办公室之间还没有建立联网,而且学校分为两个校区（又不在一个城市). 　　因此，学工部每年的学分登记工作都很麻烦．每学年初，学工部要把当年发布的学分评测规定发到各系，学年末又要把从系里面提交的学分表收齐,然后手工登记,非常的麻烦.有时是系里面的学分报表太乱，有些资料丢失，要么是，系里面把各年的学分评测规定弄混，经常搞的他们一头雾水，于是为他们就请我做这个系统. 　　这个系统的工作流程是，每个学年初，学工部输入当年的学分评定规定，然后到处成为学分评测数据，然后Copy给各个系，各个系在每个学年中，输入新的专业，年级，班级和新生的资料，然后登记学分评测的纪录和考试的成绩．当学年末到了，各系把党学年的数据导成数据库，然后copy给学工部，学工部就可以用电脑纪录所有的学分纪录． -should I do our school among a software, it is our resolve to schools such conditions-- every office has not yet been established between the network and the school is divided into two campuses (not in a city). Therefore, each of the credit among a registration work very troublesome. Every beginning of the school year, among a year should release the credit evaluation of the provisions of the various faculties, should also learn from the end line inside the table collected credits, and then manual registration, very troublesome. Sometimes there is too much of the credit chaos statements, some of the inform

条码标签打印直接连接数据库实现数据灵活打印-data print

次代码是实现平衡二叉树的数据结构算法。参考的是严蔚敏c和c++数据结构书上的思想。经过调试可以连续实现删除、插入、查找算法-Sub-code is to achieve a balanced binary tree data structure algorithms. Reference is Yan Wei-Min c and c++ data structure book ideas. Debugging can be achieved through a continuous delete, insert, search algorithm