the-shortest-path-of-chart

说明：   简单的链表实现 链表可以初步了解(A simple list can be linked to achieve a preliminary understanding)

讲述数据机构的图论部分和程序设计的关系，适合学习算法的同学学习阅读，很不错的一本书。(Graph theory algorithm and programming)

求最长上升下降\非上升非下降的刷表法(Seeking maximum rise fall Philippines rise fall Philippines brush table method)

c语言编写链式线性表的初始化，创建，插入删除等操作。(c language chained linear table is initialized, create, insert and delete operations.)

矩形件最优排样的程序,用Visual C编写，在6.0下能正常运行。(Rectangular pieces Optimal Nesting program)

本实验设有一个线性表，分别实现数组结构存储的原地逆置。为数据结构课程必做实验。(This experiment has a linear form, respectively, to achieve the storage array structure in situ reverse home. For the data structure courses will do the experiment.)

分析汉诺塔，选择合适方法编程实现汉诺塔问题的解答。(Analysis of the Tower of Hanoi, select the appropriate method of programming the answers of the Tower of Hanoi problem.)

C语言插入排序算法及代码 C语言中函数参数的传递有：值传递、地址传递、引用传递这三种形式。题一为值传递，题二为地址传递，题三为引用传递。(Insertion sort algorithm and C language code The parameter of function in C language transfer: transfer value, address, pass by reference to these three forms. Problem a value transfer, the transfer of Title address, three for reference. )

　广度优先搜索及深度优先搜索，用C语言实现，比较使用(Breadth-first search and depth first search, using C language, compared with)

最优二叉搜索树问题具有最优子结构性质，即其任意一棵子树都是一棵独立的最优二叉搜索树，所以可以采用动态规划方法，并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)