搜索资源列表
heap
- 選擇排序法的概念簡單，每次從未排序部份選一最小值，插入已排序部份的後端，其時間主要花費於在整個未排序部份尋找最小值，如果能讓搜尋最小值的方式加快，選擇排序法的速率也就可以加快，Heap排序法讓搜尋的路徑由樹根至最後一個樹葉，而不是整個未排序部份，因而稱之為改良的選擇排序法。
graph, heap, sorting, timing source code-- common datastruct
- graph, heap, sorting, timing source code
code
- 一个效率还可以的配对堆 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 th
maxheap
- maximum heap and print
report+of+Algorithm
- 算法设计的实验报告 包括Bottom-Up Merge Sorting算法、插入排序算法Heaps的创建堆、堆排序算法、按秩合并算法以及带路径压缩算法、实现查找第K小元素算法、实现快速排序算法、实现平面内最接近点对算法、实现最长公共子序列算法、实现矩阵链相乘算法、实现0/1背包问题算法、实现Dijistra’s算法、Prim算法、Kruskal算法、文件压缩算法-Experimental Algorithm Design Report including Bottom-Up Merge So
heap
- 程序用VC编写，完成插入、删除、调整堆、输出堆元素的功能 ①输入的形式和输入值的范围：输入元素个数与数据。 ②输出的形式：排列输出。 ③ 程序所能达到的功能：插入、删除、调整、输出。 -Heap and
heap
- 对堆进行基本操作有删除，增加结点，以及对堆进行调整，本代码是关于增加和删除堆中的结点-the algorithm about add and delete nodes in heap
FILE39
- c 代码 用串的堆分配存储结构来实现小文本编辑器 不需要密码 就可以轻松解压-c code using strings of heap allocated storage structure to achieve a small text editor does not require a password can easily extract
SSP
- 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 performanc
heap
- 数据结构，图结构和堆结构，图算法和堆算法的实现-Data structure, graph structure and the reactor structure, map algorithms and Heap Algorithm
ijkstra_binary_heap
- 单源最短路径,dijkstra算法+二分堆,邻接表形式,复杂度O(mlogm)-Single-source shortest path, dijkstra algorithm+ 2 sub-heap, adjacency list form, complexity of O (mlogm)
Heap
- 堆排序的C++实现。该堆实现是基于数组。-C++ implementation for Heap Sort
heap
- 可以创建堆,并且对堆进行插入,删除,排序等操作.-Can create a heap, and the insertion of the heap, delete, sort, such an operation.
Heap
- 堆的基本操作，插入删除，把数组变为小根堆，并检查是否为小根堆，用小根堆排序的方法按降序对大小为n的数组进行排序。-The basic operation of the heap, insert delete the array into a heap of small roots, and check the heap for small roots, roots with a small heap sort in descending order by means of an array of
Heaps
- a heap class + program wriitten in c++. it implements a max heap
heap
- 使用堆排序法，将一个无序的序列排成有序的序列-Using the heap sort, arranged in a disorderly orderly sequence sequence
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
- HEAP SORT IMPLEMENTATION IN C
heap
- 介绍了如何创建一个堆和调整堆，并如何利用堆来进行排序-Describes how to create a heap and adjust the heap, and how to use the sort heap
heap
- 利用C++实现了最大堆和最小堆的初始化，插入、删除操作，在此基础上实现了堆排序(On the basis of C++, the initialization, insertion and deletion of the maximum heap and the minimum heap are implemented. On this basis, the heap sort is implemented.)