搜索资源列表
统计英文文章的字符个数并huffman编码
- a)需求分析： 任务 ：对一篇英文文章，统计各字符出现的次数，实现Huffman编码； 要求：输出每个字符出现的次数和编码，其中求最小权值要求用堆实现； b)概要设计： 本程序所使用的数据结构是树和线性表，所使用的算法主要有堆排序、赫夫曼算法。 -a) Requirements Analysis : Mandate : an article in English, statistics of the number of characters to achieve Huffma
prim
- 图的操作，最小生成树的原代码！（用pirm做的哦！）- Chart operation, smallest production tree s original code! (Does with pirm oh!)
heapsort
- A heap is a binary tree satisfying the following conditions: This tree is completely balanced. If the height of this binary tree is h, then leaves can be at level h or level h-1. All leaves at level h are as fa
mst
- 最小生成树 MST的四种算法实现。 包括普通的Kruskal算法和Prim算法，用Disjoint-Set优化的Kruskal算法和用Heap优化的堆算法。 复杂度分别为O(mn), O(n^2), O(m log n), O(m log n)-Minimum Spanning Tree Algorithm
HeapsortCodes
- Heapsort 1.A heap is a binary tree satisfying the followingconditions: -This tree is completely balanced. -If the height of this binary tree is h, then leaves can be at level h or level h-1. -All leaves at level h are as far to the left as po
Tree
- 数据结构中树的程序，包括二叉树，线索二叉树，树与森林的遍历，堆，以及Huffman树等。-Tree data structure in the process, including binary trees, Threaded Binary Tree, tree and forest traversal, heap, and the Huffman trees.
Heap-sort
- 堆积排序(Heapsort)是指利用堆积树（堆）这种资料结构所设计的一种排序算法，可以利用数组的特点快速定位指定索引的元素。 -Heap sort (Heapsort) is the use of stacked tree (heap) data structure designed such a sorting algorithm can take advantage of the characteristics of the array elements quickly locate t
heap
- 使用MFC可视化界面，实现数据结构中的对排序，初始堆和排序后的堆都用树控件显示-Visual interface using MFC, data structure of the sort, after the initial heap and sort heap is a tree control displays
Heap
- Heap Class based on binary Tree. Used in many programs.
Classification-of-binary-tree
- 利用分类二叉树查找及堆排序实现学生成绩管理 -Classification of binary tree search and sort heap of student achievement management
HEAP
- Implement binomial min heap and leftest tr-Implement binomial min heap and leftest tree
tree
- 天津大学树，二叉树，堆的复习资料。适合初学者使用。比较倾向acm-Tianjin University of trees, tree, heap review the information. Suitable for beginners to use. Compare tendency acm
binary tree,Quick sort, Heap Sort
- binary tree,Quick sort, Heap Sort C programs
The-size-of-the-heap
- 堆的实现通过构造二叉堆(binary heap),实为二叉树的一种 由于其应用的普遍性,当不加限定时,均指该数据结构的这种实现。-Heap by constructing a binary heap (binary heap), is actually a binary tree due to the universality of its application, the time when unqualified, refer to the data structure to achiev
heap
- java实现的d叉树堆的事例从2叉到4叉树-An instance of Java to achieve d ary tree heap 2 forks to the 4 fork tree
implementation-for-the-Heap-Trees
- It s required to design an Abstract Data Type (ADT) Java implementation for the Heap Trees data structure that includes the following operations: 1. Constructor and display operations 2. Creating a Heap Tree a given array 3. Adding an elemen
HEAP
- Implementation of heap tr-Implementation of heap tree
BTREE
- Implementation of heap tr-Implementation of heap tree
heapsort
- Heap sort Algorithm using heap tree data structure c-Heap sort Algorithm using heap tree data structure c++
Heap sorting
- 本程序可实现堆排序重构，用完全三叉树来实现堆排序中的堆(This program can achieve heap sort refactoring, and use full tri tree to achieve heap sort.)