资源列表
数据结构系列数学问题
- 数据结构系列常见数学问题代码集锦，包括猴子分桃，百鸡百钱等一系列经典问题-series of common data structure code Collection mathematical problems, including monkeys - peach, 100 chickens hundred classic series of money problems
货担郎问题
- 货担郎问题，求两点间最短路径。单源最短路径的求取。-goods, for the shortest path between two points. Single-source shortest path to the strike.
floatbck
- 表达式求值，用顺序栈实现，表达式可以为多位数浮点型，先转换为后序表达式输出，然后求值。-expression evaluates, with the order Stack, in the expression for multi-digit floating point, after first converted to the output sequence expression, and then evaluated.
someag
- 各种内部排序法演示，程序对输入的无序序列分别用简单插入，折半插入，一趟快速排序，简单选择排序，堆排序等算法进行排序输出。-internal sequencing demonstrated that the procedures for the importation of disorderly sequences were inserted with a simple, half-inserted, the trip rapid sequencing, simple choice, in ord
mazh
- 旅行商问题的算法，采用分枝限界。网上都只有算法描述，没有实现，这里给出了完整实现，并封装成1个类。-TSP algorithm used Branch and Bound. Only online algorithm descr iption, failed to materialize here is the realization of complete, and packaged as a category.
实验七
- 几种排序算法的动画演示,包括冒泡排序,选择排序,插入排序,快速排序,堆排序,支持单步演示,-several algorithm animation demonstration, including Bubble Sort, select, in order of insertion sort, quick sort, heap sort, support single-step demonstration
depthfirst
- 这个程序是数据结构的经典算法的实现，用深度优先进行遍历的程序，原创哦-The program is the data structure of the classical algorithm implementation using depth-first traversal of the procedures for the original Oh!
widthfirst
- 这个也是个数据结构的经典算法，通过广度优先进行遍历，原创-This a data structure of the classical algorithm, through the breadth priority traversal, originality!
new2
- 树的优先遍历搜索算法，用C编的，请各位多多指教哦，原创的-priority traverse tree search algorithms, C series, please exhibitions Oh, originality!
suanfa1
- 这个是数据结构（C语言版）的上机书的习题答案算法，经过整理的，非常不错-This a data structure (C language) edition of the book on the machine answer the questions algorithm, collated, very good!
9-267
- 折半查找算法的实现，数据结构第九章的算法-binary search algorithm implementation, data structure algorithms Chapter IX
普里姆
- 数据结构.普里姆算法-最小生成树 供初学者参考，通过对该系统的设计，可以很好的理解树的概念和用途-data structure. Primbetov algorithms-the minimum spanning tree for beginners reference, the system design can have a very good understanding of the concept of the tree and use