这是继一之后的第2个管理信息系统的案例 很不错的 大家来看看吧...

小波变换算法，运用小波理论，优化其核心算法，提高计算效率-wavelet transform algorithm, using wavelet theory, optimizing their core algorithm, improve computational efficiency

本文档容括了C（C＋＋）所有算法，分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theory, algorithm, knapsack algorithm, sorting algorithm, high-precision algorithms, tree traversal, binary conversion, the whole arrangement and combination of generation, search algorithm, greedy , backtracking framework, DFS framework, BFS framework, data structure-correlation algorithm. And examples of source

这是一个数据库项目，是为任何公司开发的人力资源系统。它维护员工的详细信息、员工的职责和公司的工资管理。

this will host ms paint-this will host ms paint...

sqlite是一种嵌入式数据库。本文件包含了操作此数据库的一个类。该类实现了sqlite的所有操作，并具有良好的注释说明。-sqlite is an embedded database. This document contains the operation of this database, a class. Sqlite class implements all the operations, and has a good explanatory notes.

图论*匈牙利算法 的两种实现过程 Matching的巧妙在于队列的进入退出并没有仅仅限于在同一层循环中做到，构思巧妙 其算法思想在《算法设计与分析基础》上可以参阅-Graph theory* Two Hungarian Algorithm realization process ingenious Matching queue entry and exit is not just limited to the same level as the cycle done, the idea of clever ideas in their algorithm,

KDtree的建立代码 ，采用中分策略的KD树建立，以及基于KDtree的最近领域搜索，直接就可运行，直观。对于初学者理解KDTREE很有帮助，此KDtree程序仅仅供学习只用。

完全基于ODBC API封装的数据库访问库源代码。可以支持主流数据库。接口间接，清晰。-Based entirely on the ODBC API package, database access library source code. Can support the mainstream databases. Interface, indirect and clear.

(1)输入E条弧,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(s)和最迟开始时间l(s).若某条弧满足条件e(s)=l(s),则为关键活动.-(1) E importation of Arc lt; J, kgt; Establish AOE- network storage structure (2) v starting point source, ve [0] = 0, by topological sorting point for the rest of the earliest timing ve [i] (1LT ; = ilt; = n-1). if the Topography vertex orderly sequence number is less than net n vertices, a statement that net presence in Central, not for Critical Path, algorithm implementation steps to terminate or (3) (3) from the Department of v starting point, Vl [n-1] = ve [n-1], by the inverse order for the remaining topology of the latest occurrence of peak time Vl [i] (n-inversion; = IGT; = 2). (4) According to the apex of ve and Vl value for each s arc of the earliest timing e (s) and the latest starting time

严蔚敏老师的数据结构专贴。考研的朋友要好好看哦 是内部资料啊-Yan Wei Min teacher posted a data structure. Graduates to make good friends FACT internal information ah