code
所属分类:数据结构
开发工具:C++
文件大小:3KB
下载次数:95
上传日期:2008-10-26 10:49:08
上 传 者:
lemon_cn
说明: 一个效率还可以的配对堆
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 (949, 2008-10-26)
code\dijkstra\edge.h (1019, 2008-10-26)
code\dijkstra\pairingheap.h (1948, 2008-10-26)
code\dijkstra (0, 2008-10-26)
code\pairing heap\pairingheap.h (1948, 2008-10-26)
code\pairing heap (0, 2008-10-26)
code (0, 2008-10-26)
近期下载者:
相关文件:
收藏者: