jiaotongzixun

本系统采用C语言编写，利用邻接链表实现最短路径问题，关键路径问题等(The system uses the C language, using adjacency list realize the shortest path problem, critical path issues)

普利姆算法用来求解最小生成树问题很容易，使得树的最小权值最小。(Prim algorithm used to solve the minimum spanning tree problem is easy, the minimum weight is the lowest of the tree)

c语言完成的数据结构几个小算法游戏包括迷宫求解等(C language of complete data structure several small algorithm game includes maze solution, etc )

这个是关于数据结构中冒泡排序算法的实现，大家可以利用这个为基础，进一步研究和利用排序(This is a data structure on the Bubble Sort algorithm, we can use this as a basis for further study and use of sorting)

用C语言实现的普通快速排序，和随机快速排序进行对比(With ordinary C language implementation of quick sort, quick sort and compare the random)

计算点到直线的距离．输入两点坐标确定一个直线，再输入一个点的坐标，计算该点到直线的距离．(Calculated point to the straight line distance. Enter the coordinates of two points determine a straight line, and then input the coordinates of a point, to calculate the straight-line distance between points.)

使用非递归的方法遍历二叉树，可以直接运行。( Non-recursive binary tree traversal.)

B-树的创建、插入、删除等一系列操作！(B-tree creation, insert, delete a series of manipulations!)

该代码实现了深拷贝的问题，对于深拷贝进行了一系列的介绍，并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)

迷宫问题 队列求解 界面还不完善 可以自己添加(Maze problem solving interface queue is not perfect you can add your own)