资源列表
main
- 用3种方法实现图的遍历，前序，中序，后序-Using three kinds of methods to achieve graph traversal, pre-order, middle order, the order of
main
- 读入一个文本后，统计其中出现的英文字母的频率-Reading a text, the statistics on the frequency of the letters appear
main
- 建立树，并对已建立的树中的data实现插入、删除、查找3种操作-The establishment of a tree, and the tree has been established to achieve the data insert, delete, search for three kinds of operations
SundayAlgorithm
- 字符串高效匹配算法Sunday，是目前单字符串匹配算法中最为高效的一种。-Efficient string matching algorithm Sunday, is currently the single most efficient string-matching algorithm as a.
long_division
- 大整数整除，char *d返回余数，char*c返回结果 -Large integer divisible, char* d return the remainder, char* c return result
littletree
- 最小生成树,基本满足最小生成树的所有的要求。-Minimum spanning tree, minimum spanning tree basically meet all the requirements.
tree-2.65.tar
- 这是一个表示数据结构tree的c++模板对象,封装的非常好.tree-msvc.hh能在 visual c++下使用,如同使用stl标准模板类库一样-This is a tree data structure that the c++ template object, the package is very good. Tree-msvc.hh be able to use visual c++, as the use of standard template library stl the s
MRELFFT
- 利用分裂基算法求实序列 的DFT， 的虚部赋值为零。-Split-radix algorithm for the use of realistic sequence of DFT, the imaginary part of the assignment to zero.
rebuild
- 根据先序和中序遍历的结果，重新构造二叉树-According to the results of the PreOrder and InOrder visit,rebuild the bitree
NOI2009
- 最新noi2099解题报告.包含源程序.标注以及解答.-Latest noi2099 problem-solving report. Contains source. Callout and answer.
noi2008
- noi2008解题报告.内含详尽解答.并且含有数据.-noi2008 problem-solving report. contains a detailed answer. and contain data.
poj2488
- 回溯法的模板，关键是回溯的过程，以及在深搜过程中的方向问题-Backtracking template, the key is back process, as well as in the course of the deep question of the direction search