对象

实现岛上建立公路的最短路径算法，调用了dikstra算法-Highway on the island to achieve the establishment of the shortest path algorithm, called algorithm dikstra

希尔和归并排序，基于数据结构的相关知识。-Hill and merge sort, based on the data structure knowledge.

建立赫夫曼树，然后再由叶子到根实现赫夫曼编码。-Huffman tree set up, and then leaves to the root by the Huffman encoding implementation.

documents classification and words statiscs TF/IDF etc

求图的任两结点间的距离，(2) 用二维数组存放C和A ，C是原成本矩阵，A 是求出的距离矩阵 (3) 算法采用三重循环，其中最外层的循环变量必须代表中间结点，中层的循环变量代表头结点而内层循环变量代表尾结点。 (4) 试着把三层循环变量的顺序作些改变，最外层的循环变量仍代表中间结点，而中层循环变量代表尾结点，内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同 (5) 显示结果要清晰易懂 (6) 本题运行结果 -Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The q

清华大学数据结构讲义-data structure lectures Tsinghua University

数据结构迷宫求解：用非递归方法求迷宫路径-Data structure to solve the maze: a maze with non-recursive method, to calculate the path

动态规划的是思想实现，快速查找最长公共字串的问题（二维数组和一维数组的实现）-adapt the DP to solve the common longest strings(two and one dimension array)

c实现的常用几个算法-c achieve several commonly used algorithms

数据结构与算法-程序、素材---使用矩阵类-Data Structures and Algorithms- procedures, materials--- the use of matrices