资源列表
最优二叉搜索树
- 算法设计的动态规划中的最优二叉搜索树问题，是用VC＋＋编写的-algorithm design of dynamic optimal planning of two forks search tree problem by using VC + + prepared
B树
- 自己开发的b+树代码,经过本人测试,已经初步通过,有问题请联系我-b own development code tree, after I test, it already passed, please contact the problems I
数据结构习题集答案
- 包含了数据结构课后大多数习题的解答，用于互相的交流与帮助 -contains data structures OSCAR most of the questions to answer, for the exchanges and mutual help
顺序栈的基本操作
- 顺序栈的基本操作，一共9个，与吴伟民数据结构课本完全一致，用C实现-order stack the basic operation, a total of nine, and Xiulan WU Weimin textbooks data structure is fully consistent with achieving C
队列相关的所有基本算法
- 队列相关的所有基本算法，西电的老师写的，与吴伟民数据结构课本完全一致，用C实现-cohort of all the basic algorithm, the West -- written by the teachers, and textbooks Xiulan WU Weimin data structure is fully consistent with achieving C
huffman编码解码
- 这是一个霍夫曼编码解码的源程序,可以用它高效实现霍夫曼解码编码,注释详细,可读性好.压缩包止包括源程序文件,再vc中运行.-Hoffman codec of the source, can be used to achieve efficient codec Hoffman Notes detailed and readable. Compressed only those source files, then vc run.
Bellman-Ford算法
- Bellman-Ford算法 是最短路径算法的一种-Bellman-Ford algorithm is the shortest path algorithm of a
图的遍历演示
- 一． 问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序，演示在连通的无向图上访问全部节点的操作。二． 基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Descr iption many issues involving maps of algorithms are to traverse the map-based. A written test procedures,
数据完整程序（课程设计）
- 数据结构中各种排序算法，数据结构中各种排序算法-data structure various sequencing algorithms, data structures of various Sort Algorithm
36
- 判断给定的二叉树是否相似，用C ++实现的，是作业-to judge whether the binary tree similar to that used C to achieve, and is operating
8皇后动态图形
- 清华大学版的数据结构书实验编的解决8皇后问题的原程序，还是动态的显示。-version of the experimental data structure book series to solve the problems of the original Queen's procedures, or dynamic display.
数据结构各章考研题
- 数据结构各章的全国各大院校的考研习题 对广大考研学生来说非常有用-data structure of the national chapter of the major institutions in taking tests for the majority of the questions the students taking tests is very useful