9f18761b19
This is a fibonacci-heap priority-queue implementation. This project is different from K. Kodamas PQueue in that it allows a decrease key operation. That makes PriorityQueue usable for algorithms like dijkstras shortest path algorithm, while PQueue is more suitable for Heapsort and the like.
5 lines
273 B
Text
5 lines
273 B
Text
$NetBSD: distinfo,v 1.1.1.1 2006/05/03 05:17:48 minskim Exp $
|
|
|
|
SHA1 (priority-queue-0.1.2.tar.bz2) = e6466f75cb9f18008754c0b9ce97ad770d07728d
|
|
RMD160 (priority-queue-0.1.2.tar.bz2) = 855abee6f57bfe4360838d23a12063f801c53f19
|
|
Size (priority-queue-0.1.2.tar.bz2) = 67415 bytes
|