搜索资源列表
minheap vs minleftisttree
- 这是一个用C++编写的代码,实现了最小堆和最小左偏树在插入删除元素性能方面进行比较. -This is a preparation of the C code, the smallest and youngest sculpture tree in the left side inserted delete elements performance comparisons.
MinHeap
- 最小堆头文件(C++)-smallest Live (C)
MinHeap
- 算法与数据结构中，最小值堆的实现与运算。
minheap
- 最小堆，自己写的一个最小堆程序，只有插入构建最小堆的功能
Haffman
- huffman 算法 包含的主要个文件： minheap.h:初始化堆 haffman.cpp:具体实现huffman算法
2nd_chapter
- 《算法设计与分析》王晓东编著，第二章递归与分治策略课本例子代码实现- Algorithm Design and Analysis edited by Wang Xiaodong, chapter and sub-rule strategy recursive textbook example of code to achieve
MinHeap
- 最小堆实现方法，代码来自北大赵海燕老师编著的数据结构与算法。-Minimum heap method, code Zhao Haiyan teachers from Beijing University and edited by the data structure and algorithm.
HuffmanTree
- 文件包含HuaffmanTree.cpp，与头文件HuaffmanTree.h和MinHeap.h 编译后可生成哈弗曼树,是学习数据结构的很重要的基础-the file includes HuaffmanTree.cpp and HuaffmanTree.h and MinHeap.h
MinHeap
- 数据结构（清华第2版）中，可重用的最小堆类-Data structure (Tsinghua 2nd edition), the minimum heap reusable classes
MinHeap
- 最小堆，实现相关函数 结构是线性，逻辑是树-Minimum heap structure to achieve correlation function is linear, logic tree
huffmantree
- huffman tree的实现代码,包含huffman.h,minheap.h和main.cpp三个文件-the application of huffmantree
BinaryHeap
- binaryHeap(minheap)是数据结构中很重要的一个,我的code是用iterator做的，比较有学习的意义,用户可以自己输入数字,然后系统会自动转换成binaryHeap-binaryHeap (minheap) data structure is a very important one, I 的 code is iterator Zuode, 比较 learning the meaning, the user can 自己 enter a number, then the sys
BiTreeApp
- 原创：C#实现数据结构的测试最小堆、测试二叉搜索树、测试Huffman编码-C# BiTreeApp MinHeap BinSearchTree HuffmanTree
heap
- 這是一個用C語言所寫的minHeap程式 具有create,findmin,deletemin,Insert這些函式-It is written in a language with a C program with minHeap create, findmin, deletemin, Insert these functions
Heap-Sort
- This is Heap sort,can sort minheap and maxheap
MinHeap
- 最小堆头文件,因为是作业做的比较系,很好用的,运行流畅.对出学者很有用-Minimum Duitou file because the operating system to do more, well used, running smoothly. Of the scholars is useful
MinHeap
- 最小堆的VC++实现，包括头文件和C源文件-approach MIN HEAP，including the header file
TopKMax
- 找出一组数字中最大的K个数，用一个K大小的最小堆维护-Output top K numbers in an array using a minheap with heapsize equals to K
minheap
- 数据结构C++最小堆的实现，代码简单明了，实现了堆中元素的删除，插入，取堆顶元素等-The data structure of the realization of the least C, code simple and clear, realize the pile in the deletion of the elements, insert, take pile of top elements
huffmancode-0.1
- 构造霍夫曼树 ////////////////////// //根据权重生成霍夫曼树 //weight 权重数组 //n 权重数组长度 //NewTree 新生成的霍夫曼树 void createHFMTree(int* weights,int n,BinaryTree<int>& NewTree) { //初始化堆 MinHeap<BinaryTree<int> > heap(n) int i=0 f