文件中是我编写的两个数据结构，线性表列和链表，是用类模版函数编写，是面向过程设计...

icarnegie 课程的sdd7的练习2，满分，决对正确，放心使用-icarnegie practice sdd7 courses 2, perfect, the right decision, rest assured that the use of

数据结构实验程序 线性表 栈和队列 二叉树 图 查找 内部排序-Experimental procedures for linear data structures stack and queue table tree diagram to find the internal order

实现了 web service得数据库查询，更新，删除得功能，简便耐用。-May realize a web service database query, update, delete a feature, simple and durable.

计算机算法设计，用于设计动态规划，你们懂得-Computer algorithms designed for the design of dynamic programming, you know

pb实现的气泡窗口，非常实用-pb achieve the bubble window, a very practical

这是一个霍夫曼编码解码的源程序,可以用它高效实现霍夫曼解码编码,注释详细,可读性好.压缩包止包括源程序文件,再vc中运行.-Hoffman codec of the source, can be used to achieve efficient codec Hoffman Notes detailed and readable. Compressed only those source files, then vc run.

程序员的SQL金典程序员的SQL金典程序员的SQL金典程序员的SQL金典程序员的SQL金典程序员的SQL金典程序员的SQL金典

一个效率还可以的配对堆 Fibonacci Heap太难写了 配对堆可以有效替代Fibonacci Heap 附带了用它实现的Dijkstra 复杂度O(nlogn+e) -An efficient matching can also be hard to heap Fibonacci Heap wrote a pairing heap Fibonacci Heap can be an effective alternative to use it comes with the realization of Dijkstra complexity O (nlogn+ E)

c++下的AOV实现-c achieve the AOV

数据结构常用算法之一-Dijkstra算法,实现最短路径选择.-algorithm commonly used data structures one-Dijkstra algorithm to achieve the shortest path to choose.