Location:
Search - heap
Search list
Description: 堆排序算法，the heap sort algorithm-Heap Sort algorithm, the heap sort algorithm
Platform: |
Size: 7168 |
Author: fqihang |
Hits:
Description: //Demo of the heap ADT (maxheap). For documentation
// see the lecture slides.
Platform: |
Size: 1024 |
Author: zhang wei |
Hits:
Description: 算法与数据结构中，最小值堆的实现与运算。-Algorithm and data structure, the minimum heap with computing.
Platform: |
Size: 1024 |
Author: zz |
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: 非常有用的东西，打击放心下载吧，堆学习NS2是很有帮助的-Very useful things, to combat assured download it, heap Learning NS2 is helpful
Platform: |
Size: 2305024 |
Author: mmdzxz |
Hits:
Description: 一个效率还可以的配对堆
Fibonacci Heap太难写了
配对堆可以有效替代Fibonacci Heap
附带了用它实现的Dijkstra
复杂度O(nlogn+e)
-An efficient matching can also be hard to heap Fibonacci Heap wrote a pairing heap Fibonacci Heap can be an effective alternative to use it comes with the realization of Dijkstra complexity O (nlogn+ E)
Platform: |
Size: 3072 |
Author: 武永基 |
Hits:
Description: maximum heap and print
Platform: |
Size: 1024 |
Author: TT |
Hits:
Description: 算法设计的实验报告
包括Bottom-Up Merge Sorting算法、插入排序算法Heaps的创建堆、堆排序算法、按秩合并算法以及带路径压缩算法、实现查找第K小元素算法、实现快速排序算法、实现平面内最接近点对算法、实现最长公共子序列算法、实现矩阵链相乘算法、实现0/1背包问题算法、实现Dijistra’s算法、Prim算法、Kruskal算法、文件压缩算法-Experimental Algorithm Design Report including Bottom-Up Merge Sorting Algorithm, Insertion Sort algorithm creation Heaps Heap, Heap Sort algorithm, according to rank and merge algorithm with path compression algorithm to find the first small element K algorithm, the realization of quick sort algorithm, the realization of planar within the nearest point on the algorithm to achieve the longest common sub-sequence algorithm, the realization of matrix-chain multiplication algorithm, the realization of 0/1 knapsack problem algorithm Dijistra s algorithm, Prim algorithm, Kruskal algorithm, file compression algorithm
Platform: |
Size: 28672 |
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: c 代码 用串的堆分配存储结构来实现小文本编辑器 不需要密码 就可以轻松解压-c code using strings of heap allocated storage structure to achieve a small text editor does not require a password can easily extract
Platform: |
Size: 1024 |
Author: fu xingyou |
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: I implement Dijkstra s Single Source Shortest Path, say SSP, algorithm for directed graphs using a simple data structure, say simple scheme, Fibonacci heaps, say F-heap scheme, and Pairing heaps, say P-heap scheme, and measure the relative performance of the three implementations.
Platform: |
Size: 209920 |
Author: LA |
Hits:
Description: a) 使用Dijkstra算法和Floyed算法.
b) 对Dijkstra算法使用二叉堆[尝试Fibonacci Heap,发现效率不佳].
c) 对Dijkstra算法进行改进,堆中只保存目前可达的未标记节点,减少堆的大小从而提高堆操作效率.-fsdgjlkfghjhkl给句话、好几个和家干好、fgghjf
Platform: |
Size: 343040 |
Author: zjy |
Hits:
Description: 数据结构，图结构和堆结构，图算法和堆算法的实现-Data structure, graph structure and the reactor structure, map algorithms and Heap Algorithm
Platform: |
Size: 835584 |
Author: 黄舒颖 |
Hits:
Description: 通过Java语言实现了选择、插入、冒泡、希尔、快速、归并、堆、基数等8种排序算法-Java based selection, insertion, bubble, shell, quick, merge, heap, radix sorting algorithm
Platform: |
Size: 11264 |
Author: 陈昱安 |
Hits:
Description: pku oj 3159 dijkstra + heap-pku oj 3159 dijkstra+ heap
Platform: |
Size: 1024 |
Author: lixin |
Hits:
Description: 使用堆结构进行排序操作，这样可以用最小时间复杂度-Sort heap structure used to operate, it can be the smallest time complexity
Platform: |
Size: 238592 |
Author: 杨坤 |
Hits:
Description: 堆排序算法:堆排序算法是一种高效的原地排序算法，复杂度nlbn-heap sort
Platform: |
Size: 223232 |
Author: yang |
Hits:
Description: 利用窗体实现堆排序。并能逐一显示堆排序的过程-Using the form to achieve Heap Sort
Platform: |
Size: 84992 |
Author: kaxium |
Hits:
Description: binary heap data structures
Platform: |
Size: 3072 |
Author: vaggelis |
Hits:
«
1
2
34
5
6
7
8
9
10
...
50
»