LIC 数据库系统

用VC6 MFC开发的记账软件。记账数据保存在Access数据库，是新手入门的好素材。软件功能包括记账内容查询统计，账目记录、修改、删除等。

简单介绍了一种数据结构的构建及其使用情况,-introduces a simple data structure of the building and its use,

包含冒泡排序算法函数模板和数据结构中的字符串查找例子及解线性方程组的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.

这是网络上一位网友自己写的数据结构里一些算法的实现，对学习数据结构的初学者比较有帮助。-This is a network of friends to write their own data structure to achieve a number of algorithms, data structures for beginners to learn more to help.

串的KMP算法，无回溯的模式匹配中最具代表性的是KMP算法。它是基于对模式本身的字符分布特征所进行的分析，生成模式的特征向量，显示了P= aab 匹配S= ababbaabaa 的优化的KMP算法过程。-Strings of KMP algorithm, no backtracking pattern matching is the most representative of the KMP algorithm. It is based on a model of their own characters by distribution analysis of eigenvectors generated model shows that P = aab match S = ababbaabaa the KMP algorithm optimization process.

彩电故障信息共享系统 本程序使用Visual C++６.0编程制作信息共享系统,实现信息管理共享的自动化。由此实现了信息的增加、删除、修改、查看等功能，并且进而实现信息的安全管理，使信息的管理更加人性化，规范化。从而提高故障排除效率，提高信息利用率，有助于进一步提高了生产效率。-TV fault information sharing system of the present procedures using Visual C 6.0 programming produced information sharing system, Sharing information management automation. This realization of the information to add, delete, modify, check, and other functions, and thereby achieve information security management, information management more humane and standardized. Improve troubleshooting efficiency, improve utilization of information and help further enhance the efficiency of production.

Kruskal算法寻找最小生成树,C语言实现，有完整的注释！-Kruskal finding minimum spanning tree algorithm, C Language, a complete Notes!

设n个不同的整数排好序后存于T[0:n-1]中。若存在一个下标I,0

建立赫夫曼树，然后再由叶子到根实现赫夫曼编码。-Huffman tree set up, and then leaves to the root by the Huffman encoding implementation.

这是一个用于计算最小生成树的程序。当人们逐个输入每条边的权，再点击生成，便能得到这个图的最小生成树。-This is a used to calculate the minimum spanning tree procedure. When people enter one by one each side of the right, then click generate, will be able to get this graph minimum spanning tree.