文件名称: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 the realization of Dijkstra complexity O (nlogn+ E)
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)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
code
....\dijkstra
....\........\dijkstra.cpp
....\........\edge.h
....\........\pairingheap.h
....\pairing heap
....\............\pairingheap.h
....\dijkstra
....\........\dijkstra.cpp
....\........\edge.h
....\........\pairingheap.h
....\pairing heap
....\............\pairingheap.h