Design Paterns

具有n 个顶点的无向网络G的每个生成树刚好具有n-1条边，采用三种不同的贪婪策略来选择这n-1条边。-n vertices to the non-G network spanning tree just with each n-1 edge, using three different strategies to choose greed that n-1 edge.

VB图书管理系统，基于VB的图书管理系统的程序开发，只作参考-VB library management system, library management system based on the VB-program development, only for reference

数据设计课程实验，二叉树存储设计源码，c语言编写。-Data design course experiments, binary storage design source, c language.

C++软件设计开发 C++，进销存，access，开发，软件 C++，进销存，access，开发，软件 C++，进销存，access，开发，软件 C++，进销存，access，开发，软件C++，进销存，access，开发，软件C++，进销存，access，开发，软件

将前缀表达式转为中缀表达式，并画出所建的树-To prefix infix expression to expression, and draw the tree built

TrainReset:there are many trains need to drive out of the station .In terms of their numbers from small to large.There are only three railways used to place the trains ,and also need the same order.-TrainReset : there are many trains need to drive out of the sta tion. In terms of their numbers from small to deviation ge.There are only three railways used to place t he trains, and also need the same order.

有关启发式搜索的经典算法：A*最短路径算法的实例和对应程序。关注的朋友可以留意一下。（比传统的Dijistra算法效率高很多哦！^_^）-the heuristic search algorithm of the classic : A* shortest path algorithm examples and the corresponding procedures. Concerned friends can look. (Dijistra than the traditional algorithm efficiency is much higher oh 70,000

VB做的电话号码查询程序-VB done for the telephone number of procedures

RDBMS Design and Implementation: Normalization