资源列表
huffman_coding
- c++ 编写的哈夫曼编码程序，实现对数据的哈弗曼编码-c++ to prepare the Huffman coding process, the realization of the data encoding哈弗曼
beta3
- 一个有关哈夫曼编码的例子，可以编码，屏幕打印，和输出。-An example of Huffman coding can be coded, screen printing, and output.
clgl_lz
- 一个有关停车场管理的小程序，应用到栈和队列的知识。-A small car park management procedures, applied to the stack and queue knowledge.
people
- 一个人事管理的c++源程序，应用到数据结构的知识。-Personnel management of a c++ source code, applied to the data structure knowledge.
lcs
- 一道经典的动态规划题目 浙江大学硕士生入学复试上机题 http://acm.hdu.edu.cn/showproblem.php?pid=1231-Classic dynamic programming http://acm.hdu.edu.cn/showproblem.php?pid=1231
20090224171138551
- 主要内容： 匹配的概念 二分图的定义和判定 二分图的最大匹配 二分图的最小覆盖问题 二分图的最佳匹配问题 -Main elements: the concept of matching the definition of bipartite graph and determine the maximum bipartite graph matching bipartite graph of minimum coverage of bipartite graph match
disjointset
- 主要讲述了并查集的具体实现（树形）和应用，并配有例题-And focuses on the concrete realization of search sets (tree) and applications, and sample questions with
expressions
- 有关表达式的栈的应用 内容有：表达式括号匹配 计算后缀表达式的值 计算算术表达式的值 中缀表达式转后缀表达式-Expression of the application stack are as follows: the expression in brackets to match the calculated value of the suffix arithmetic expression expression is made up of expressions of
dfssamples
- 朴素的没有优化过的dfs 题目有：借书问题，骑士的游历，迷宫问题，细胞个数-There is no simple optimized dfs topics: library issues, Knight' s tour, the maze problem, the cell number
findingpath
- 主函数里有一个矩阵表示的有向连通图，功能是输入起止位置，找出所有最短路径。-It is a pronglen for fining a path
datastructure
- 数据结构清华大学殷人昆电子版版2002年4月第1版-datastructure，Tsinghua University,renkunYin, version of the electronic version in April 2002 Release 1
zuiduanlujingwangluoliu
- 最短路径与网络流 讲解最短路径与网络流的算法及其实现-The shortest path and network flow on the shortest path and network flow algorithm and its implementation