一个实用的厂矿管理系统。

浙大acm在线评判系统zju online judge上面的题目解答源码（1），对于想要提高自己编程能力的同学来说是极好的资料，网上一般不会把这些源代码贴出，本人此次奉献出，也是想为广大编程爱好者做点贡献。-Zheda acm online evaluation system zju online judge the subject to answer the above source (1), for the programming you want to improve their own ability to students is excellent information, the Internet is generally not the source code of these posted, I am the dedicated, but also for the general programming enthusiasts would like to做点贡献.

新收集的客户管理软件-new collection of customer management software

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

设计邻接表类,实现无向图的深度优先非递归遍历,无向图的广度优先遍历,并设计主函数输入数据进行测试-Design category adjacency list, realize undirected graph of the depth-first traversal non-recursive, non-directed graph breadth-first traversal, and the design of the main function of the input data for testing

编译系统： Visual C++ 6.0 操作系统： Windows 2000/XP 这几个程序对于学习和理解数据结构有很大的帮助。-Compiler System : Visual C 6.0 operating system : Windows 2000/XP these procedures for the study and understanding of data structure will be very helpful.

对中缀表达式求值 用栈的方法对中缀表达式求值-zhong

这是一个不错的数据库管理程序-This is a good database management procedures

数据算法，小明买书-data algorithm, Xiao Ming books

最小生成树问题 若要在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.

its about the binary recursion