DoubleStack

数据结构习题答案，线性链表的实现与适用，数据结构：思想与实现2-9(Data structure exercises answer, linear linked list implementations with applicable data structure: Ideas and Implementation 2-9)

一个很好的银行家算法，能运行(A good banker s algorithm, will be able to run)

本资料为数据结构的相关试卷，可以帮助大家解决一下有关考试的问题(This information is relevant papers data structure that can help you solve the problems concerning the examination)

用银行家算法实现资源分配,Bankers algorithm to achieve the allocation of resources(Bankers algorithm to achieve the allocation of resources)

数据结构经典算法 约瑟夫问题 c++ 已经测试通过(josephus c++)

最短路径算法。 用无向带全图的邻接矩阵存储图，确定从源点出发到其它各点的最短路径。 输入：图中包含的顶点数n 边数m， 各边权值，用邻接矩阵或者邻接表存储。 输出：源点到其它各点的最短路径值。(Shortest path algorithm. Adjacency matrix storage with undirected graph with a full figure, determine the starting point of the shortest path from the source point of each other. Input: Vertices figure included n the number of edges m, the weight of each side, with the adjacency matrix or adjacency table storage. Output: source shortest path to value each other points.)

VS2010开发 C++语言 实现异质链表(The VS2010 development C++ language heterogeneity linked list)

选择排序的实现，是一种基本的排序方法，但是时间复杂度相对较大。(Select Sort realization, is sort of a basic, but relatively large time complexity.)

实现经典问题老鼠迷宫，并用坐标将路径显示出来(Achieve classic problem rat maze, and coordinate with the path displayed)

使用的排序算法，非常不错的思维，比较其他有较大优势(Sorting algorithm used, very good ideas, have greater advantages compared with other)