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: 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: some useful little program for new learner
Graph Alg.:Red-Black tree,Dijkstra s algorithm,Depth first search and breadth first search.
Heaps:Fibonacci heap source..
Sorting:Various array sorting algorithms..
Searching:Array searching algorithms Platform: |
Size: 156672 |
Author:史宇飞 |
Hits: