1

主要是DIJKSTRA经典算法，可以作为单个算法来读，也可以调用。(DIJKSTRA mainly classical algorithm can be read as a single algorithm can also be called.)

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

使用很好的数据结构，程序运行效率高，界面简洁美观。(Good data structure, high efficiency, simple and beautiful interface.)

采用邻接矩阵实现有向网的存储，建立有向网，并实现单源最短路径算法。(The realization of the use of adjacency matrix to the network storage, the establishment of the network, and to achieve single-source shortest path algorithm.)

经典的 数据结构问题 八皇后问题。问题是在8*8的棋盘上放置棋子，要求每条直线上不能出现两个或以上的棋子。(The classical data structure problem Eight queens problem.Question is placed on the 8* 8 board piece, requirements on each line cannot appear two or more pieces.)

表达式cpp实现 数据结构实验源代码 实现前序、中序、后序表达式(Expression codes Formerorder expressions regular expression&Postorder expressions )

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

数据结构与程序设计中的重点例子程序：八皇后问题(Data structure and procedures of the focus of the design example of the procedure: eight queen problem)

说明：  KMP算法的具体实现，能够在O(n+m)时间内找出字串在父串中的位置，n为父串长度，m为字串长度(KMP in the proposed algorithm, can be O (n+ m) time to find the string in the parent string position, n the parent string length, m for the string length)

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