Location:
Search - heap tree
Search list
Description: 傅清祥 算法与数据结构
它覆盖了《计算机学科教学计划1993》中开列的关于算法与数据结构主科目的所有知识单元。其主要内容有：算法与数据结构的概念、抽象数据类型（ADT）、基于序列的ADT（如表，栈，队列和串等）。反映层次关系的ADT（如树，堆和各种平衡树等）、关于集合的ADT（如字典，优先队列和共查集等）、算法设计的策略与技巧、排序与选择算法、图的算法、问题的计算复杂性、并行算法。 全书强调“算法”与“数据结构”之间密不可分的联系，因而强调融数据类型与定义在数据类型上的运算于一体的抽象数据类型，为面向对象的程序设计方法打下扎实的基础。 本书以知识单元为基本构件，具有可拆卸性和可重组性，内容丰富，表述详细，适合不同类型的院校按照不同的培养规格组织教学，其中基础部分可作为计算机学科各专业本科生的教材，高级专题部分可作为高年级本科生或研究生的教材。 -li, algorithm and data structure which covers the "Computer Science Teaching Program 1993" listed on the operator Law and data structures of all the main subjects of knowledge modules. Its main contents are : algorithm and data structure of the concept of abstract data types (ADT), Based on the sequence of ADT (table, stack, queue and strings, etc.). Reflect the level of relations between the ADT (such as trees, and balancing the heap tree, etc.), on the set of ADT (as a dictionary. Priority Queue and unearthed collection, etc.), algorithm design strategies and techniques, sorting and selection algorithms, graph algorithms, the computational complexity, parallel algorithm. Guidebook stressed that "algorithms" and "data structures," the inextricable link betwee
Platform: |
Size: 11807424 |
Author: wu |
Hits:
Description: 图的操作，最小生成树的原代码！（用pirm做的哦！）- Chart operation, smallest production tree s original code!
(Does with pirm oh!)
Platform: |
Size: 1024 |
Author: 王猛 |
Hits:
Description: 提高输入容错。判断输入的对错。 时间关系，搜索功能为线性搜索，现增强如下：f_search:费氏查找法；btree:二叉树查找法；l_search：线性查找法； r_search：递归折半查找法；zcsear:杂凑碰撞查找法；o_sear:插补查找加强法； 排序是冒泡法，现增强为：heaps:累堆排序；binary：二叉树排序；xieer：谢耳排序；sinsert：插入排序；quicks:快速排序；select:选择排序法；-increase input fault tolerance. Imported wrong judgment. The time, a search function for the linear search is enhanced as follows : f_search : Fernandez search method; BTREE : binary tree search method; L_search : linear search method; R_search : recursive binary search method; Zcsear : hash collision search method; " Files : interpolation search Enhancement Act; Sorting is bubbling, as it is now : heaps : tired heap sort; binary : Binary Tree sorting; xieer : Xie ears scheduling; sinsert : Insert scheduling; quicks : rapid sequencing; select : Select Sort;
Platform: |
Size: 4096 |
Author: 王军 |
Hits:
Description: 傅清祥 算法与数据结构
它覆盖了《计算机学科教学计划1993》中开列的关于算法与数据结构主科目的所有知识单元。其主要内容有：算法与数据结构的概念、抽象数据类型（ADT）、基于序列的ADT（如表，栈，队列和串等）。反映层次关系的ADT（如树，堆和各种平衡树等）、关于集合的ADT（如字典，优先队列和共查集等）、算法设计的策略与技巧、排序与选择算法、图的算法、问题的计算复杂性、并行算法。 全书强调“算法”与“数据结构”之间密不可分的联系，因而强调融数据类型与定义在数据类型上的运算于一体的抽象数据类型，为面向对象的程序设计方法打下扎实的基础。 本书以知识单元为基本构件，具有可拆卸性和可重组性，内容丰富，表述详细，适合不同类型的院校按照不同的培养规格组织教学，其中基础部分可作为计算机学科各专业本科生的教材，高级专题部分可作为高年级本科生或研究生的教材。 -li, algorithm and data structure which covers the "Computer Science Teaching Program 1993" listed on the operator Law and data structures of all the main subjects of knowledge modules. Its main contents are : algorithm and data structure of the concept of abstract data types (ADT), Based on the sequence of ADT (table, stack, queue and strings, etc.). Reflect the level of relations between the ADT (such as trees, and balancing the heap tree, etc.), on the set of ADT (as a dictionary. Priority Queue and unearthed collection, etc.), algorithm design strategies and techniques, sorting and selection algorithms, graph algorithms, the computational complexity, parallel algorithm. Guidebook stressed that "algorithms" and "data structures," the inextricable link betwee
Platform: |
Size: 11806720 |
Author: wu |
Hits:
Description: 迄今为止见过的最方便的huffman编码，效率很高
一个外国人写的，很具有研究价值
Constructing a Huffman Tree according to the number of times each symbol appears in the data stream:
1) Create an array of N nodes, representing N possible symbols (ranging between 0 and N-1).
2) Set the value of each node to the number of times that its symbol appears in the data stream.
3) Create a Minimum-Heap of N nodes.
4) Add every node whose value is greater than zero to the heap.
5) Extract the best two nodes in the heap.
6) Create a parent node whose children are the two extracted nodes.
7) Add the parent node to the heap.
8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap).
9) Extract the last node in the heap.
The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.
The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.-So far seen the most convenient huffman coding, efficient write a foreigner, I have research value Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes , representing N possible symbols (ranging between 0 and N-1) .2) Set the value of each node to the number of times that its symbol appears in the data stream.3) Create a Minimum-Heap of N nodes.4) Add every node whose value is greater than zero to the heap.5) Extract the best two nodes in the heap.6) Create a parent node whose children are the two extracted nodes.7) Add the parent node to the heap.8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap) .9) Extract the last node in the heap.The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.
Platform: |
Size: 17408 |
Author: 游弋人生 |
Hits:
Description: 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 far to the left as
possible.
The data associated with all descendants of a
node are smaller than the datum associated
with this node.-A heap is a binary tree satisfying the followingconditions :
Platform: |
Size: 1024 |
Author: linru |
Hits:
Description: 最小生成树 MST的四种算法实现。
包括普通的Kruskal算法和Prim算法，用Disjoint-Set优化的Kruskal算法和用Heap优化的堆算法。
复杂度分别为O(mn), O(n^2), O(m log n), O(m log n)-Minimum Spanning Tree
Algorithm
Platform: |
Size: 3918848 |
Author: 黄劲松 |
Hits:
Description: 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 possible.
-The data associated with all descendants of a node are smaller than the datum associated with this node.
Implementation
1.using a linear array not a binary tree.
-The sons of A(h) are A(2h) and A(2h+1).
2.time complexity: O(n log n)
Platform: |
Size: 196608 |
Author: 黃文岩 |
Hits:
Description: 本书所呈现的源码，使你踏上了基度山岛。源码之前了无秘密，你将看到vector的实现、list的实现、heap的实现、deque的实现、Red Black tree的实现、hash table的实现、set/map的实现；你将看到各种算法（排序、查找、排列组合、数据移动与复制技术）的实现；你甚至能够看到底层的memory pook和高阶抽象的traits机制的实现。-The source code presented in this book, so that you set foot on the base of Monte island. Prior to the non-secret source code, you will see the vector implementation, list the implementation, heap implementation, deque implementation, Red Black tree implementation, hash table implementation, set/map for implementation you will see the various algorithms (sort, find, permutations and combinations, data movement and replication technology) is achieved you can even see the bottom of memory pook and higher-order abstract traits mechanism for implementation.
Platform: |
Size: 10075136 |
Author: 祝鹏 |
Hits:
Description: 数据结构中树的程序，包括二叉树，线索二叉树，树与森林的遍历，堆，以及Huffman树等。-Tree data structure in the process, including binary trees, Threaded Binary Tree, tree and forest traversal, heap, and the Huffman trees.
Platform: |
Size: 30720 |
Author: 冷山道 |
Hits:
Description: 堆积排序(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 the specified index.
Platform: |
Size: 1024 |
Author: mfeng |
Hits:
Description: 使用MFC可视化界面，实现数据结构中的对排序，初始堆和排序后的堆都用树控件显示-Visual interface using MFC, data structure of the sort, after the initial heap and sort heap is a tree control displays
Platform: |
Size: 26624 |
Author: wangyun |
Hits:
Description: Heap Class based on binary Tree. Used in many programs.
Platform: |
Size: 5120 |
Author: Hans |
Hits:
Description: 利用分类二叉树查找及堆排序实现学生成绩管理 -Classification of binary tree search and sort heap of student achievement management
Platform: |
Size: 311296 |
Author: the spring |
Hits:
Description: Implement binomial min heap and leftest tr-Implement binomial min heap and leftest tree
Platform: |
Size: 8192 |
Author: peggy |
Hits:
Description: 天津大学树，二叉树，堆的复习资料。适合初学者使用。比较倾向acm-Tianjin University of trees, tree, heap review the information. Suitable for beginners to use. Compare tendency acm
Platform: |
Size: 531456 |
Author: 阎杰 |
Hits:
Description: 堆的实现通过构造二叉堆(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 achieve this.
Platform: |
Size: 742400 |
Author: |
Hits:
Description: java实现的d叉树堆的事例从2叉到4叉树-An instance of Java to achieve d ary tree heap 2 forks to the 4 fork tree
Platform: |
Size: 10240 |
Author: sydonay |
Hits:
Description: 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 element to the Heap Tree
4. Deleting an Element the Heap Tree
5. Sorting the array of elements using the Heap sort algorithm -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 element to the Heap Tree
4. Deleting an Element the Heap Tree
5. Sorting the array of elements using the Heap sort algorithm
Platform: |
Size: 8192 |
Author: tamer |
Hits:
Description: Heap sort Algorithm using heap tree data structure c-Heap sort Algorithm using heap tree data structure c++
Platform: |
Size: 1024 |
Author: srikanth |
Hits: