c achieve the AOV

数据结构的java实现-data structure to achieve the java

链队列的操作及普里姆算法的演示，便于理解算法。-chain operation and Primbetov algorithm demo, easily comprehensible algorithms.

1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。 3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！） -Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps created by the depth and breadth-first search traversal, given the culmination of the process of traversal sequence. 3 order to map the minimum spanning tree, according to the order of the output side of the sequence structure. (Both methods require!)

货郎担 最短路径问题 用链表储存最短路径节点-traveling salesman problem using the shortest path Listless storage nodes Shortest Path

图书管理程序,b-tree,c++语言完成。程序非常的棒-library management procedures, b-tree, c complete language. Procedures for the wand! !

ado and access operatiion such as insert delet update -ado and access operatiionsuch as insert delet update

数据结构演示系统，有助于进一步了解和验证数据结构中的算法-data structure presentation systems and contribute to further understanding and validation of data structure algorithms

该代码可以解决职工的信息管理和工资、奖金的管理系统，同时该管理系统具有很好的数据承载能力，后期的维护工作可能稍微要轻松点的。。。

我自己写的AOE网络算法-I wrote it myself AOE Network Algorithm

数据结构――动态规划算法-data structure-- Dynamic Programming