xianxinglianbiao

求有向图的最短路劲，根据所给图的边长和顶点，建立有向图，以邻接表的方式存储，并编写程序求从有向图任一点出发的最短路径(according to the graph with sides and vertex, establish a directed graph, and write a program find the shortest path from one of the point of the chart )

平衡二叉树操作，可以输入数字形成二叉树，可以进行添加、删除操作(Balanced binary tree operation, you can enter numbers to form a binary tree, the user can add, delete)

POJ 字符串的插入 可以将一定长度的字符串插入之前给出的字符串之中(POJ string can be inserted into a length of string into a string before being given)

本程序实现一元多项式合并。本程序输入方式为按项输入，每输入一个项，会先提示输入项的幂，再提示输入项的系数。(This procedure combined to achieve a dollar polynomial. This procedure according to entry input methods for the input, one for each input item, it will first prompt entry of the power, and then prompts entry of the coefficient.)

代码注重B树插入、删除的算法逻辑，适用于 学习者研究B树实现的核心思想。代码中无庞杂的无关操作(focus on B-tree code insertion, deletion algorithm logic applies to B-tree research learners to achieve the core idea. The code has nothing to do with the complex operation )

说明：  线性链表的定义，遍历，查找，删除，排序。(Linear list definition, traversal, search, delete, sort.)

说明：  进程死锁.资源分配图的绘制 建立所需数据结构；  使用题目21存成的资源分配图的文件作为输入；  编写资源分配图化简算法；  每化简一步，在屏幕上显示化简的当前结果；  最后给出结论，是否死锁，如思索给出死锁的进程及资源； (Process deadlock. Resource allocation mapping  establish the required data structures  Use title 21 deposit into resource allocation graph file as input  writing resource allocation map simplification algorithm  Each simplification step, on-screen display simplification of the current result  Finally, the conclusion of a deadlock, deadlock is given as thinking processes and resources )

提供字符串方法，大家面试可以用，包括找出对称字串(Some string function)

实现折半查找，非递归形式，从而实现数据结构所要的结果。(To achieve binary search, the non-recursive form)

使用C语言建立带头结点链表实现了集合。并进行了性能上的优化。(Achieve set using C to build list witch head node. And make optimization in performance.)