资源列表
compmouse
- 老鼠走迷宫程序实际示例 可以寻找所有路径以及找出所有路径当中的最短路径。-Mouse Maze procedure can find all the practical example of the path and find the shortest path among all paths.
Joseph
- 有关著名的约瑟夫问题，用了三种方法，链表，公式化描述和虚拟指针-Joseph, the well-known problem, with the three methods, lists, descr iptions and virtual pointer formulaic
Huffman
- 程序可以实现哈弗曼自动编码功能！很详细的！很有参考价值！-Program can be Havermann automatic coding features! Very detailed! A good reference!
code
- Mark Allen Weiss 1987年在普林斯顿大学获得计算机科学博士学位,师从著名算法大师Robert Sedgewick,现任美国佛罗里达国际大学计算与信息科学学院教授.他曾经担任全美AP(Advanced Placement)考试计算机学科委员会的*(2000-2004).他的主要研究方向是数据结构,算法,和教育学.- In this second edition of his successful book, experienced teacher and autho
HUFMM
- 哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。所谓树的带权路径长度，就是树中所有的叶结点的权值乘上其到根结点的径长度（若根结点为0层，叶结点到根结点的路径长度为叶结点的层数）。树的带权路长度记为WPL=(W1*L1+W2*L2+W3*L3+…+Wn*Ln)，N个权值Wi(i=1,2,…n)构成一棵N个叶结点的二叉树，相应的叶结点的路径长度为Li(i=1,2,…n)。可以证明哈夫曼树WPL是最小的。-Huffman tree is also called the optimal bina
xianxingbiao
- 线性表的操作，包括删除，插入，提取，清空等-Linear table operations, including delete, insert, extract, empty, etc.
migong
- 这个是做好的走迷宫，在程序最后输入一个迷宫数组，并给好开始点和结束点数组号，程序都能帮你走出这个迷宫，并将走通的路径用#标出，走过而没走通的用一个笑脸表示出来，很有意思的！-This is the good of the Maze, a maze in the program last input array, and to a good start point and end points group number, the program is help you out of this ma
ACMtemplate
- acm学习资料，包括常用算法及数值计算的程序模板。-acm learning materials, including the commonly used algorithms and numerical calculation of the program template.
Maze
- 本程序实现找一个迷宫的最短路径。程序的实现方法是从开始结点开始对这个迷宫进行广优先遍历 -The process to achieve a maze to find the shortest path.
8block
- 功能描述：本程序实现找一个八方块问题的最短移动路径。 -Function Descr iption: This program achieved an eight-box problem to find the shortest mobile path.
hash
- 采用C++构建一个哈希表，包括哈希表操作等，有广泛的应用-Using C++ to build a hash table, including the hash table manipulation, there is a wide range of applications
zj
- c语言版数据结构课程设计，实现了算术表达式的加减乘除 取反 乘方 括号识别 赋值运算等，内有标注-c-language version of the data structures curriculum design, implementation of the arithmetic expression to take anti-involution, Math parentheses identify assignment operator, etc., there labeled