请假销假的管理系统

AirtoFly.com中的长途有关信息抓取,并存写在数据库中-AirtoFly.com relevant information in long-distance crawling, both written in the database

数据结构迷宫求解：用非递归方法求迷宫路径-Data structure to solve the maze: a maze with non-recursive method, to calculate the path

sqlite 3.3.8 支持加密的版本-sqlite 3.3.8 supports encrypted version

使用递归的方法实现的算式分析器，给定一个符合C语言格式的算式，可以使用括号，单目运算符等，计算算式的运算结果。-use recursive method formula Analyzer, to set a C-language format with the formula, you can use brackets, Monocular Operators, calculation formula of the calculation results.

单纯形法，可以用于进行线性规划解的求取。在数学上有一定的应用价值，但速度上可能不太优化，如果对速度有要求的，可参考MATLAB-Simplex method, linear programming solution can be used to carry out the strike. In mathematics there is a certain value, but the speed may not be optimized for speed if required, can refer to MATLAB

这个程序用于实现哈希表，在初始化时赋予哈希表20个数值，然后点击查看当前哈希表，完成后点击重建哈希表-This process used to implement hash table, given in the initialization hash table 20 values, and then Click to view the current hash table, click on the reconstruction after the completion of hash table

用C语言实现的表达式的求值，关于数据结构的栈方面的知识，已经通过测试！-With the C language implementation of the evaluation of the expression on the stack data structure of knowledge, has passed the test!

有需要的同仁载回去慢慢研究-need colleagues set back slowly study

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

本文是介绍数据结构中的二分查找，比较数等思想及算法的-this paper is to introduce the data structure to search two hours, a few more ideas and algorithms