xiaobaishu

采用邻接矩阵实现有向网的存储，建立有向网，并实现单源最短路径算法。(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.)

希尔排序，希尔排序，希尔排序，希尔排序，c语言(shell sort)

实现冒泡，快速，希尔排序法。并计算，比较他的次数。(Achieve bubbling fast shell sort. And calculate, compare the number of times.)

数据结构课设，城市地铁站的设计与使用规划(Set data structure class, subway station design and use of planning)

约瑟夫环（约瑟夫问题）是一个数学的应用问题：已知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.)

数据结构简单的课程设计交通换乘算法,里面有零次换乘与一次换乘(Simple structure, curriculum design data traffic transfer algorithm, which have zero time transfer and a transfer)

最小生成树C语言程序，提供给喜欢编程以及数学建模的同学(Minimum spanning tree C language program)

一个经典的旅行商问题源码，不是最优解，只是一种 思路(A classic traveling salesman problem source is not the optimal solution, just a thought)

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

魔方问题 数据结构 使用c++ 经典问题(Cube problem Data Structure Using c++ Classic problem)