astar

图中计算最短路径，必须覆盖所有的节点，效率很高(to compute the shortest path in the graph)

总结了10种排序的方式。用代码加以实现。(the ten way of Line up a preface)

清（英文）常见数据结构，代码实现，值得下载，值得分享(Qing (English) common data structure, code implementation, worth downloading, worth sharing)

dijkstra算法，用于寻找已建立图的最短路径，是非常有用的一个算法(Dijkstra algorithm, has been established for finding the shortest path map is a very useful algorithm)

数据结构计算算术表达式算法，可以计算小数点及较复杂的运算表达式(Data structure algorithms calculate arithmetic expression, we can calculate the decimal point and more complex operations expression)

迷宫求解一般采用“穷举法”，逐一沿顺时针方向查找相邻块（一共四块－东(右)、南(下)，西(左)、北(上)）是否可通，即该相邻块既是通道块，且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)

用邻接表表示的数据结构，及DIJKSTRA算法实现的最短路径程序(adjoining table with the data structure and algorithm DIJKSTRA the shortest path procedures)

实现约瑟夫问题的4种算法，并有计时功能进行效率测试(4 algorithms to resolve Josephus Problem with timing counter for testing efficiency)

约瑟夫环的循环链表实现，这个程序比较完整，有需要做试验的请速速下载。(Josephus cycle Chain achieved, the procedure is complete, the pilot needs to be done urgently requested to download.)

c++用栈来实现迷宫求解（c语言数据结构）(c++ stack maze solving (c language data structure))