DIJKSTRA算法实现的最短路径程序linjiebiaoshortpath

约瑟夫环（约瑟夫问题）是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。通常解决这类问题时我们把编号从0~n-1，最后结果+1即为原问题的解。 (Josephus (Josephus problem) is the application of a mathematical problem: Given n individuals (with numbers 1,2,3 ... n respectively) sitting around a round table. From the number of people gettin k, number of the m man out of the line he s the next person and a number of gettin number to m the man was out of the line and so the law is repeated until the round table were all out of the column. We numbered 0 ~ n-1, the final result is the original problem solution+1 usually solve these problems.)

主要用栈和树求解骑士问题，用C++语言编写的(The main stack and tree Cavalier Problem Solving with C++ languages)

说明：  约瑟夫算法，适合初步学习数据结构的同学了解递归调用的特点(josephus in C language)

邻接表存储图，然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)

C++中，对链表的增删改查的基本使用，值得学习(C++, on the list of CRUD basic use, it is worth learning)

江苏大学数据结构研究生试题2009Jiangsu University graduate examination papers(Jiangsu University graduate examination papers)

自己编写的floyd 最短距离求解程序。实用简单。gcc (Floyd shortest distance to write your own solver. Practical and simple. gcc)

二叉树的设计。包含二叉树结点类的设计以及二叉树的遍历。(Binary tree design. Contains the binary tree node class design, and Binary Tree Traversal.)

迪杰斯特拉算法，数据结构，C语言写的，上大学计算机系会用到的。。。(Dijkstra algorithm, data structures, C language written on the Department of Computer Science will be used. . .)

排序程序,包含快速排序、归并排序、谢尔排序、插入排序。输出了比较次数和移动次数。(It is a sort program, including quick sort, merge sort, shell sort and insert sort.It outputs the compare times and movement times.)